The Kosaraju-Sharir algorithm is an algorithm used to find strongly connected components in a graph.
Applying the algorithm on the graph given above, how many strongly connected components do we find, and what is the size of the biggest component, and the size of the smallest? (respectively)
- 4, 7, 2
- 4, 8, 1
- 5, 6, 2
- 6, 5, 1
- None of the above.
Original idea by: Pedro Henrique Di Francia Rosso
No comments:
Post a Comment