Uh oh!
There was an error while loading.Please reload this page.
- Notifications
You must be signed in to change notification settings - Fork5.7k
Added: Tarjan's SCC algorithm and test cases#1774
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 ourterms of service andprivacy statement. We’ll occasionally send you account related emails.
Already on GitHub?Sign in to your account
base:master
Are you sure you want to change the base?
Added: Tarjan's SCC algorithm and test cases#1774
Uh oh!
There was an error while loading.Please reload this page.
Conversation
codecov-commenter commentedApr 15, 2025 • edited
Loading Uh oh!
There was an error while loading.Please reload this page.
edited
Uh oh!
There was an error while loading.Please reload this page.
Codecov ReportAttention: Patch coverage is
Additional details and impacted files@@ Coverage Diff @@## master #1774 +/- ##==========================================+ Coverage 85.87% 85.94% +0.06%========================================== Files 377 378 +1 Lines 19720 19829 +109 Branches 3005 3028 +23 ==========================================+ Hits 16935 17042 +107- Misses 2785 2787 +2 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
@appgurueu can you please review my pr and give feedback. |
Pull Request Title:
Description of the Change:
I’ve implemented Tarjan’s Algorithm for finding Strongly Connected Components (SCC) in a directed graph, and added test cases to ensure correctness. This algorithm uses a depth-first search (DFS) approach and provides an efficient solution for identifying SCCs.
What did I do?
Checklist:
TarjanSCC.js
).Let me know if any adjustments are needed!