生成图和图的宽度优先遍历和深度优先遍历

一个图有边和结点，边包含权重、入结点和出结点，结点包含值、入度、出度、next结点集、和边的集合。可以用以下代码表示：

public class Edge {
	public int weight;
	public Node from;
	public Node to;
	
	public Edge(int weight, Node from, Node to) {
		this.weight = weight;
		this.from = from;
		this.to = to;
	}
}

public class Node {
	public int value;
	public int in;
	public int out;
	public 	ArrayList<Node> nexts;
	public ArrayList<Edge> edges;
	
	public Node(int value) {
		this.value = value;
		in = 0;
		out = 0;
		nexts = new ArrayList<>();
		edges = new ArrayList<>();
	}
}

public class Graph {
	public HashMap<Integer, Node> nodes;
	public HashSet<Edge> edges;
	public Graph() {
		nodes = new HashMap<>();
		edges = new HashSet<>();
	}
}

而生成图时，可以提供一个二维数组，每个子数组为边的权重、边的入结点和出结点，可以用以下代码表示：

public