backtrack along the path that we have traced so far until we find vertex that has yet unexplored edgestake one such edgeand continue the traversal the process terminates when our backtracking leads us back to the start vertex sand there are no more unexplored edges incident on this simple process traverses all the edges of (see figure figure example of depth-first search traversal on graph starting at vertex discovery edges are shown with solid lines and back edges are shown with dashed lines(ainput graph(bpath of discovery edges traced from until back edge ( ,ais hit(creaching fwhich is dead end(dafter backtracking to cresuming with edge ( , )and hitting another dead endj(eafter backtracking to (fafter backtracking to