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 - The Fusion of Science and Community**

# Dijkstra's algorithm proof?

Know someone interested in this topic? Share a link to this question via email,
Google+,
Twitter, or
Facebook

- Similar discussions for: Dijkstra's algorithm proof?

Loading...

**Physics Forums - The Fusion of Science and Community**