This is an attempt to implement a multithreaded algorithm for finding Strongly Connected Components as described in the research paper by IBM. Along the way I'm planning to learn a lot about concurrency and graph theory. Any help warmly welcome
-
Notifications
You must be signed in to change notification settings - Fork 1
License
gutechsoc-hackathon/multithreadedSAS
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published