scirs2_graph::algorithms::traversal

Function breadth_first_search

Source 
pub fn breadth_first_search<N, E, Ix>(
    graph: &Graph<N, E, Ix>,
    start: &N,
) -> Result<Vec<N>>
where
    N: Node + Debug,
    E: EdgeWeight,
    Ix: IndexType,
Expand description

Performs breadth-first search (BFS) from a given starting node

§Arguments

  • graph - The graph to traverse
  • start - The starting node

§Returns

  • Result<Vec<N>> - The nodes visited in BFS order