Question: (a) State what is meant by a directed graph and a strongly connected component. Illustrate your description by giving an example of such a graph
(a) State what is meant by a directed graph and a strongly connected component.
Illustrate your description by giving an example of such a graph with 8 vertices
and 12 edges that has three strongly connected components. [5 marks]
(b) Describe, in detail, an algorithm to perform a depth-fifirst search over such a
graph.
(c) Describe an O(n) algorithm to discover all the strongly connected components
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
