Worksheet
1
For each of the following graphs, we want to find the paths of lowest weight between the vertex A and each of the other vertices:
i
Using Dijkstra's algorithm to find the order and label list for each vertex.
ii
For each vertex, find the least weight between itself and vertex A.
a
b
c
d
e
f
2
For each of the following graphs, use Dijkstra's algorithm to find the paths of lowest weight between vertex A and each of the other vertices:
a
b
c
d
Sign up to access Worksheet
Get full access to our content with a Mathspace account