-
Notifications
You must be signed in to change notification settings - Fork 1.7k
Add Tarjan's strongly connected components algorithm #561
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Conversation
|
Please fix 17 issues Codacy found |
- Add curly braces to all single-statement blocks - Fix naming conventions: GetSCCCount -> GetSccCount, InSameSCC -> InSameScc, GetSCC -> GetScc - Add meaningful exception message to ArgumentOutOfRangeException - Split multi-statement lines into separate lines - Update all test method names to match renamed methods
|
@siriak I've fixed all issues what Codacy found, please check it again, Thanks. |
|
Please check build errors |
0072c6a to
2f838fb
Compare
Graph has 3 SCCs not 2:
- SCC 1: {0, 1} (cycle 0→1→0)
- SCC 2: {2} (single node)
- SCC 3: {3, 4, 5} (cycle 3→4→5→3)
Codecov Report❌ Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #561 +/- ##
==========================================
+ Coverage 96.87% 96.88% +0.01%
==========================================
Files 290 291 +1
Lines 11920 12035 +115
Branches 1720 1740 +20
==========================================
+ Hits 11547 11660 +113
Misses 237 237
- Partials 136 138 +2 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
|
@siriak Seems like all tests are gone correctly. Please check it. |
Implements Tarjan's algorithm for finding strongly connected components in directed graphs.
Features:
Contribution by Gittensor, learn more at https://gittensor.io/