// Copyright 2003, Trustees of Indiana University
// Please see the license in the file ../LICENSE

// breadth_first_search algorithm from BFS

import java.lang.*;

// Not using vertex_index_map since not using default parameters now

public class breadth_first_search {
  public static <
    Vertex,
    Edge extends GraphEdge<Vertex>,
    VertexIterator extends java.util.Iterator<Vertex>,
    OutEdgeIterator extends java.util.Iterator<Edge>,
    Vis extends Visitor,
    ColorMap extends ReadWritePropertyMap<Vertex,java.lang.Integer>,
    QueueType extends Buffer<Vertex>>
  void breadth_first_search(VertexListAndIncidenceGraph<Vertex,Edge,VertexIterator,OutEdgeIterator> g, Vertex s, Visitor vis, ColorMap color) {
    queue<Vertex> Q = new queue<Vertex>();
    for(VertexIterator u_iter = g.vertices(); u_iter.hasNext(); ) {
      Vertex u = u_iter.next();
      vis.initialize_vertex(u, g);
      color.set(u, ColorValue.white());
    }
    graph_search.graph_search(g,s,vis,color,Q);
  }
}