MCPcopy Create free account
hub / github.com/neetcode-gh/leetcode / find

Method find

javascript/0684-redundant-connection.js:66–78  ·  view source on GitHub ↗
(node, { parent } = this)

Source from the content-addressed store, hash-verified

64 }
65
66 find(node, { parent } = this) {
67 let head = parent[node];
68
69 const isEqual = () => head === parent[head];
70 while (!isEqual()) {
71 const tail = parent[parent[head]];
72
73 this.compress(head, tail);
74 head = parent[head];
75 }
76
77 return head;
78 }
79
80 compress(tail, head, { parent } = this) {
81 parent[tail] = head;

Callers 1

unionMethod · 0.95

Calls 2

compressMethod · 0.95
isEqualFunction · 0.85

Tested by

no test coverage detected