breadthFirstSearch -- runs a breadth first search on the digraph starting at a specified node and returns a list of the vertices in the order they were discovered

Synopsis

• Usage:

  bfs = breadthFirstSearch(D,v)

• Inputs:
  • D, an instance of the type Digraph,
  • v, a thing,
• Outputs:
  • bfs, a list, A list of the vertices of D in order discovered by the breadth first search

Description

i1 : D = digraph ({{0,1},{0,2},{2,3},{3,4},{4,2}},EntryMode=>"edges");

i2 : bfs = breadthFirstSearch(D,0)

o2 = {{0}, {1, 2}, {3}, {4}}

o2 : List

i3 : G = cycleGraph 6

o3 = Graph{0 => {1, 5}}
           1 => {0, 2}
           2 => {1, 3}
           3 => {2, 4}
           4 => {3, 5}
           5 => {0, 4}

o3 : Graph

i4 : bfs = breadthFirstSearch(G,3)

o4 = {{3}, {4, 2}, {5, 1}, {0}}

o4 : List

See also

• reverseBreadthFirstSearch -- runs a reverse breadth first search on the digraph and returns a list of the vertexSet in the order they were discovered
• depthFirstSearch -- runs a depth first search on the digraph or digraph and returns the discovery time and finishing time for each vertex in the digraph
• topologicalSort -- outputs a list of vertices in a topologically sorted order of a DAG.