# Exercise: Classify Edges of an Undirected Graph

Undertake this exercise to understand edge classification in undirected graphs.

## We'll cover the following

## The task at hand

Grab a paper and a pen and work out how the edges of the graph 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 graph 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 graph (after selecting the “Drag vertices” checkbox).

Get hands-on with 1200+ tech skills courses.