Exercise: Classify Edges of a Directed Graph

The task at hand

Grab a paper and a pen and work out how the edges of the digraph given below will be classified by depth-first search. Assume that the depth-first search is implemented so that vertices having smaller subscripts are visited first.

You may verify your solution by clicking the “Classify Edges” button.

Note:

• You may also try experimenting on a different digraph that can be created following these instructions.instructions
• If the automatically generated labels overlap with vertices or edges, you may view them more clearly by dragging the vertices of the given digraph (after selecting the “Drag vertices” checkbox).