图的宽度优先遍历

图的宽度优先遍历

public class BFS {

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

}
···