Math 180 Homework

Complete the iterations of Dijkstra's algorithm for the following example. What is the minimal path from S to T?