vertex.java

Java实现的双连通分支算法

import java.util.*;

public class Vertex {
	public int DFS_Num; //顶点的DFS数
	public int High; //顶点的high值
	public int parent; //在DFS树中的父节点
	public boolean mark; //构造DFS树是用来标记是否被访问
	public LinkedList<Integer> Edge;//与该顶点连接的边
	
	Vertex(){ //构造函数
		DFS_Num = High = parent = 0; 
		Edge = new LinkedList<Integer>();
		mark = false;
	}
}