Does anyone here know how to prove this? I'm stuck on how to even get this started.(adsbygoogle = window.adsbygoogle || []).push({});

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.

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Dijkstra's algorithm proof?

**Physics Forums | Science Articles, Homework Help, Discussion**