Example: quiz answers
Dijkstra’s algorithm: Correctness by induction

Dijkstra’s algorithm: Correctness by induction

Back to document page

Since d(x) is the length of the shortest s-to-xpath by the I.H., d(x) ‘(Q x), giving us d(x) + ‘(xy) ‘(Q x): Since yis adjacent to x, d(y) must have been updated by the algorithm, so d(y) d(x) + ‘(xy): Finally, since uwas picked by the algorithm, umust have the smallest distance label: d(u) d(y):

  Algorithm, Xpath, Dijkstra

Download Dijkstra’s algorithm: Correctness by induction


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries