Breadth-First Search (BFS) algorithm

[byjtew]

Implementation of a Breadth-First Search (BFS) algorithm.

Versions

• 1. Compute the number of steps to explore the entire graph
  • grb::RC bfs( const Matrix< D > & A, size_t root, size_t & total_steps )
• 2. Compute (1.) and the minimum number of step(s) to explore each node
  • grb::RC bfs( const Matrix< D > & A, size_t root, size_t & total_steps, grb::Vector< size_t > & steps_per_vertex )