Algorithm Designex05e3_catapult
Catapult
49a9ae97-13e9-4f29-812c-50983306ea9a.cppC++
1// Loading code...Selected Submission
100 / 100
0.009s
2176 KB
GraphBFS/DFSTopo Sort
Time Comp.
O(V + E)
Space Comp.
O(V + E)
Readability
7/10
"The code implements Kosaraju's algorithm to find strongly connected components (SCCs) in a directed graph. It uses Depth-First Search (DFS) twice: once to compute the finishing times of vertices and another time on the transpose graph to identify the SCCs."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #4 | 100 | 4/1/2025 |
| Try #3 | 20 | 4/1/2025 |
| Try #2 | 20 | 4/1/2025 |
| Try #1 | 40 | 4/1/2025 |