Vertex	Distance from start
z
y
x
w
v
u
t

a) Find the shortest paths and distances between each vertex and "Start" using Dijkstra's algorithm. On the graph above, mark the separations (between vertices) and highlight the used edges.

b) What is the order in which the edges are selected using Dijkstras algorithm?

1st: _______

2nd: _______

3rd: _______

4th: _______

5th: _______

6th: _______

C) What is the shortest path (by cost) from vertex Z to vertex W?