Algorithm Designa67_q3b_graph_diameter
Graph Diameter
83e7a4d3-ba06-41e9-8769-6d6e1595d645.cppC++
1// Loading code...Selected Submission
100 / 100
0.094s
2304 KB
Shortest PathDP
Time Comp.
O(n^3)
Space Comp.
O(n^2)
Readability
6/10
"The code implements the Floyd-Warshall algorithm to find the shortest paths between all pairs of nodes in a graph, and then finds the maximum shortest path. This clearly indicates a shortest path algorithm and dynamic programming approach to solve it."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #4 | 100 | 5/10/2025 |
| Try #3 | 100 | 5/10/2025 |
| Try #2 | 100 | 5/10/2025 |
| Try #1 | 100 | 5/10/2025 |