有苦有乐的算法 --- 图的宽度优先遍历

题目

给定一个图，使用队列对其进行宽度优先遍历

代码

public static void bfs(Node start) {
	if (start == null) {
		return;
	}
	Queue<Node> queue = new LinkedList<>();
	HashSet<Node> set = new HashSet<>();
	queue.add(start);
	set.add(start);
	while (!queue.isEmpty()) {
		Node cur = queue.poll();
		System.out.println(cur.value);
		for (Node next : cur.nexts) {
			if (!set.contains(next)) {
				set.add(next);
				queue.add(next);
			}
		}
	}
}

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