Algorithm Designda66_f1_buffet_flight
Buffet Flight
2f37c217-ef7d-448c-bf46-c5936d18621d.cppC++
1// Loading code...Selected Submission
100 / 100
0.216s
12040 KB
Shortest PathImplementation
Time Comp.
O(V * E)
Space Comp.
O(V)
Readability
6/10
"The code implements a shortest path algorithm to find the minimum cost to reach each node from the starting node (0). It iteratively relaxes edges, similar to the Bellman-Ford algorithm, but with a custom cost function involving inCost and outCost."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #1 | 100 | 4/1/2025 |