Algorithm Designa66_f1_largest_diff_path
Largest Diff Path
b889d1b2-af52-465d-953b-5e1f8a7fcfda.cppC++
1// Loading code...Selected Submission
100 / 100
0.105s
3724 KB
GraphDFS / BFSImplementation
Time Comp.
O(V + E)
Space Comp.
O(V + E)
Readability
5/10
"The code performs a Depth-First Search (DFS) on a directed graph to find the maximum difference between a node's weight and the minimum weight reachable from it. The core logic revolves around traversing the graph and updating minimum weights, making DFS the primary algorithmic concept."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #4 | 100 | 3/24/2025 |
| Try #3 | 0 | 3/24/2025 |
| Try #2 | 100 | 3/20/2025 |
| Try #1 | 40 | 3/20/2025 |