discrete math
Posted: Thu May 05, 2022 7:46 pm
discrete math
17) Dijkstra Proof Homework Unanswered Prove the following theorem: Theorem 1. Dijkstra's Algorithm is O(n²) If the weighted, connected, simple graph, G has 7 vertices, then Dijkstra's algorithm for finding a shortest path is in O(n²) in the worst case.
- Discrete Math 1 (11.52 KiB) Viewed 21 times