The strategy followed by
depth-first search is, as its name implies, to search "deeper" in the
graph whenever possible.
In depth-first search, edges are
explored out of the most recently discovered vertex v that
still has unexplored edges leaving it. When all of v's edges have
been explored, the search "backtracks" to explore edges leaving the
vertex from which v was discovered. This process continues
until we have discovered all the vertices that are reachable from the original
source vertex. If any undiscovered vertices remain, then one of them is
selected as a new source and the search is repeated from that source. This
entire process is repeated until all vertices are discovered.
As C does not have
any unvisited adjacent node so we keep popping the stack until we find a node that
has an unvisited adjacent node. In this case, there's none and we keep popping
until the stack is empty.
No comments:
Post a Comment