Lines Matching refs:find
26 * Union-find data structure for {@link Node Nodes}.
37 * Create a new union-find data structure for a {@link Graph}. Initially, all nodes are in their
52 * After calling this function, find(a) == find(b).
62 * set, i.e., find(a) == find(b) if and only if a and b are in the same set.
64 public Node find(Node a) {
65 int id = find(getNodeId(a));
70 return find(getNodeId(a)) == find(getNodeId(b));
74 int aRoot = find(a);
75 int bRoot = find(b);
88 private int find(int a) {