bfs.java

void bfs(Graph graph, int s, boolean[] visited) {
		Queue<Integer> queue = new LinkedList<Integer>(); 
		visited[s] = true;
		queue.add(s);	// enqueue source s 
		
		while (!queue.isEmpty()) {
			int S = queue.poll();	// dequeue
			System.out.println("Visited vertex: " + S);
			// check the current vertex's adjacent vertices
			for (int n : graph.adj.get(S)) {
				if (!visited[n]) {
					visited[n] = true;
					queue.add(n);
				}
			}
		}

	}