KosarajuStronglyConnectedComponents

Demonstrates finding the connected component count in a directed graph

This application Demonstrates an implementation of Kosaraju's algorithm for finding the connected component count in a directed graph as described in the book "Algorithms" by Robert Sedgewick and Kevin Wayne. To add a vertex to the graph, tap on the screen. To add an edge to the graph, tap on the start vertex, and then tap on the end vertex. To find the number of strongly connected components in the graph, tap on the "Component Count" button. To clear the screen, tap on the "Clear" button.