reverseBreadthFirstSearch -- runs a reverse breadth first search on the digraph and returns a list of the vertexSet in the order they were discovered
Synopsis
Usage:
bfs = reverseBreadthFirstSearch(D,v)
Inputs:
D, an object of class Digraph (missing documentation)
Outputs:
bfs, a list, A list of the vertexSet of D in order discovered by the breadth first search
Description
A reverse breadth first search first searches the specified of a digraph, followed by that vertex’s parents, followed by their parents, etc, until all the ancestors are exhausted, and returns a list, with the index of the item of the list signifying the depth level of the result, of the vertexSet in order searched.
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
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