Project Links Logo Artwork
Graph Theory: Networking
Home > Graph Theory: Networking > Shortest-Path Algorithms > Dijkstra's Algorithm
Crib Sheet
Library
Help
Map
Problem List
Module Home
Links Home


conceptsdiscoverapplycollaboratepractice
 
 
go backgo forward
go backgo forward

Dijkstra's Algorithm

Problem 4:

Give an example of a graph with negative weights for which Dijkstra's algorithm gives an incorrect answer.

Problem 5:

Suppose line 2 is replaced with



Equation 5

How many times will the while-loop be executed with this new condition? Will the algorithm still be correct?

 
 
go backgo forward
go backgo forward