MCPcopy Create free account
hub / github.com/algorithmzuo/algorithm-journey / addEdge2

Method addEdge2

src/class195/Code08_Forest1.java:75–80  ·  view source on GitHub ↗
(int u, int v, int w)

Source from the content-addressed store, hash-verified

73 }
74
75 public static void addEdge2(int u, int v, int w) {
76 next2[++cnt2] = head2[u];
77 to2[cnt2] = v;
78 weight2[cnt2] = w;
79 head2[u] = cnt2;
80 }
81
82 public static int find(int i) {
83 if (i != father[i]) {

Callers 5

buildMethod · 0.95
pathOutMethod · 0.95
pathInMethod · 0.95
pathToPathMethod · 0.95
mainMethod · 0.95

Calls

no outgoing calls

Tested by

no test coverage detected