node.java

一个计算数据结构中图论的强连通分支问题的算法

import java.util.ArrayList;


public class Node {
	public int DFS_Number;
	public int Component;
	public int High;
	public int Num;
	public ArrayList<Integer> next =new ArrayList<Integer>();
	
	Node(){
		DFS_Number = 0;
		Component = 0;
		High = 0;
		Num = 0;
		next.clear();
	}
}