feat: add Kosaraju Algoritm #699
Conversation
11-aryan
requested review from
raklaptudirm,
tjgurwara99 and
yanglbme
as code owners
|
@raklaptudirm @tjgurwara99 Could you please review it ? |
| } | ||
| } | ||
|
|
||
| func GetStronglyConnectedComponents(n int, adj [][]int) [][]int { |
There was a problem hiding this comment.
I think it would have been much more easier to understand this algorithm if you had used the Graph data structure defined in the graph.go file. There are already a lot of helpers for that graph as well.
There was a problem hiding this comment.
I didn't use it because the Graph used in graph.go has a slightly different representation with weighted edges which is not required for current algorithm. Using an adjacency list would make it much simpler.
There was a problem hiding this comment.
If you don't need the weighted edges, then don't use the weighted edges part of the graph 😄.
Codecov ReportAll modified and coverable lines are covered by tests ✅
Additional details and impacted files@@ Coverage Diff @@
## master #699 +/- ##
=========================================
Coverage ? 87.05%
=========================================
Files ? 194
Lines ? 6241
Branches ? 0
=========================================
Hits ? 5433
Misses ? 677
Partials ? 131 ☔ View full report in Codecov by Sentry. |
|
This PR is stale because it has been open 30 days with no activity. Remove stale label or comment or this will be closed in 5 days. |
|
This PR was closed because it has been stalled for 7 days with no activity. |
No description provided.