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;
	}
}