In this project I coded up the algorithm to compute strongly connected components (SCC) and used it to compute the size of the SCCs of a directed graph that had close to one million vertices.
The java codes I wrote are in the src folder.
-
Notifications
You must be signed in to change notification settings - Fork 0
License
EmpiricalAnalysis/Strongly-Connected-Components-in-A-Directed-Graph
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
No description, website, or topics provided.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published