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

Method pop

src/class184/Code02_Difficult1.java:71–79  ·  view source on GitHub ↗
()

Source from the content-addressed store, hash-verified

69 }
70
71 public static void pop() {
72 --stacksize;
73 u = stack[stacksize][0];
74 f = stack[stacksize][1];
75 preColor = stack[stacksize][2];
76 edge = stack[stacksize][3];
77 e = stack[stacksize][4];
78 sum = sumst[stacksize];
79 }
80
81 public static void addEdge(int u, int v, int c) {
82 nxt[++cntg] = head[u];

Callers 2

getSize2Method · 0.95
dfs2Method · 0.95

Calls

no outgoing calls

Tested by

no test coverage detected