I studied the union find algo and found it is very useful in following ways.
to compress the path. (save space)
find.But if we have to find out the path between
有没有经典的算法来解决下面的问题。假设不带存在量词的联合查找算法具有以下输入:然后,它将构建一些数据结构u,以便我可以检查u.root(x)==u.root(y),以确定x和y是否在同一子图中Var = Var | Input /\ InputInput :== Var = Var | Input /\ Input | exists Var Input
什么样的联合查找</e