Next:8. Undirected GraphsUp:7.8 Programming AssignmentsPrevious:7.8.1 Implementation of Dijkstra's Algorithm Using Binary Heaps and Binomial

7.8.2 Strong Components

Finding strong components of a given digraph is an important practical problem. You have studied Kosaraju's algorithm for this purpose. There are other algorithms available in the literature for determining the strong components. Many of the references lister earlier can be consulted for this. Implement Kosaraju's and at least one other algorithm for determining strong components and compare the performance of the two algorithms.