An implementation of the Kosaraju two pass algorithm for finding strongly connected components (SCCs) of directed graphs.
-
Notifications
You must be signed in to change notification settings - Fork 0
mattomatic/kosaraju
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Kosaraju two pass algorithm for finding SCCs on directed graphs
Resources
Stars
Watchers
Forks
Releases
No releases published