Perform a breadth first search (BFS) on a graph
Perform a BFS on a graph, from a set of seed vertices. Once all vertices reachable from the seeds are visited, the search terminates.
- The input graph, an adjacency list.
- The seed vertices, a character vector.
A character vector of vertex names, the visited vertices
in the order of their visit.
Looks like there are no examples yet.