Content deleted Content added
m Undid revision 1300346054 by Idozur03 (talk) Original algorithm was correct to return the vertex u with minimum dist[u] |
→Dynamic programming perspective: downcase |
||
Line 205:
We use the fact that, if {{mvar|R}} is a node on the minimal path from {{mvar|P}} to {{mvar|Q}}, knowledge of the latter implies the knowledge of the minimal path from {{mvar|P}} to {{mvar|R}}.}}
is a paraphrasing of [[Richard Bellman|Bellman's]] [[Bellman equation#Bellman's principle of optimality|
== See also ==
| |||