題組內容

2. Apply Dijkstra algorithm to determine a shortest path from a to z in the
following graph.


(a) Please show the shortest path. The path should be represented by tracing a sequence of visited vertices, such as (a, b, f, z). (10%)