Description Usage Arguments Value
Perform a BFS on a graph, from a set of seed vertices. Once all vertices reachable from the seeds are visited, the search terminates.
1 | bfs(graph, seeds)
|
graph |
The input graph, an adjacency list. |
seeds |
The seed vertices, a character vector. |
A character vector of vertex names, the visited vertices in the order of their visit.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.