Exercise: Identify Cut-Vertices
Attempt this exercise to test your understanding of the algorithm to identify cut-vertices.
We'll cover the following
The task at hand
Grab a paper and a pen, and work out how the algorithm we just covered would identify the cut-vertices of the graph given below, assuming that depth-first search is implemented so that vertices having smaller subscripts are visited first.
Verify your solution by clicking the “Find Cut-vertices” 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.