This preview shows
page 1. Sign up
to
6
10.[10]
Use a depth-first search algorithm to identify all the articulation vertices
and biconnected components in the graph from Question 9. Draw an appropriate
depth-first graph and indicate all the
low
and
dfnumber
values.
A solution at the end
11.[15]
Write a program to find all the connected components of a graph. Describe
the ADT and data structure used in your program and make sure that your
algorithm runs in O(e) time, where e is the number of edges.
The definition of the problem is ambiguous, as it is not stated is the graph is directed or
not. However nobody asked about it. Both solutions below are ok.
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 12/10/2009 for the course CAS 2c03 taught by Professor Janicki during the Spring '03 term at McMaster University.
- Spring '03
- janicki
-
Click to edit the document details
