申論題

6. Apply Dijkstra’s Algorithm to find a shortest path from a to f. Indicate what is your shortest path and the total weight of the path. You must show every step in order to get full credits. (14 pts)