Method dfs2

src/class184/Code01_Capital1.java:161–183

(int cur, int fa, int root)

	// 收集信息迭代版
	public static void dfs2(int cur, int fa, int root) {
		stacksize = 0;
		push(cur, fa, root, -1);
		while (stacksize > 0) {
			pop();
			if (e == -1) {
				father[u] = f;
				nodeRoot[u] = rt;
				nodeVis[u] = false;
				colorVis[color[u]] = false;
				e = headg[u];
			} else {
				e = nextg[e];
			}
			if (e != 0) {
				push(u, f, rt, e);
				int v = tog[e];
				if (v != f && !vis[v]) {
					push(v, u, rt, -1);
				}
			}
		}
	}

	public static int calc(int u) {
		// dfs1(u, 0, u);