Method BfsTraversal

Java/BfsTraversal.java:9–16

(int v)

    private Queue<Integer> que; /* maintaining a queue */

    BfsTraversal(int v) {
        node = v;
        adj = new LinkedList[node];
        for (int i = 0; i < v; i++) {
            adj[i] = new LinkedList<Integer>();
        }
        que = new LinkedList<Integer>();
    }

    void insertEdge(int v, int w) {
        adj[v].add(w);