Use APKPure App
Get KosarajuStronglyConnectedComponents old version APK for Android
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.Last updated on Feb 23, 2018
Minor bug fixes and improvements. Install or update to the newest version to check it out!
Requires Android
4.1 and up
Category
Report
KosarajuStronglyConnectedComponents
1.0 by Chris Brossard
Feb 23, 2018