- #1
KataKoniK
- 1,347
- 0
Does anyone here know how to prove this? I'm stuck on how to even get this started.
Let G be a connected, weighted and undirected graph where all edges have a weight of 1.
Prove that if Dijkstra's algorithm is run on this graph, G, then the tree returned is a breadth-first tree.
Let G be a connected, weighted and undirected graph where all edges have a weight of 1.
Prove that if Dijkstra's algorithm is run on this graph, G, then the tree returned is a breadth-first tree.
Last edited: