org.graalvm.compiler.graph

Class NodeUnionFind

java.lang.Object

org.graalvm.compiler.graph.NodeUnionFind

public class NodeUnionFind
extends Object

Union-find data structure for Nodes. All operations have an accumulated worst-case complexity of O(a(n)), where a(n) is the inverse of the Ackermann function A(n,n).

Constructor Summary

Constructors

Constructor and Description
NodeUnionFind(Graph graph) Create a new union-find data structure for a Graph.

Method Summary

Modifier and Type	Method and Description
boolean	equiv(Node a, Node b)
Node	find(Node a) Get a representative element of the equivalence set of a node.
void	union(Node a, Node b) Merge the equivalence sets of two nodes.

Methods inherited from class java.lang.Object

clone, equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

NodeUnionFind

public NodeUnionFind(Graph graph)

Create a new union-find data structure for a Graph. Initially, all nodes are in their own equivalence set.

Method Detail

union

public void union(Node a,
                  Node b)

Merge the equivalence sets of two nodes. After calling this function, find(a) == find(b).

find

public Node find(Node a)

Get a representative element of the equivalence set of a node. This function returns the same representative element for all members of the same equivalence set, i.e., find(a) == find(b) if and only if a and b are in the same set.

equiv

public boolean equiv(Node a,
                     Node b)