dfs = depthFirstSearch D
dfs = depthFirstSearch G
A depth first search begins at the first vertex of a graph as a root and searches as far as possible along one branch from that root before backtracking to the next branch to the right. Discovery time denotes the order in which the vertex was searched first; finishing time denotes the time in which the vertex's descendents were all finished.




The object depthFirstSearch is a method function.