Dijkstra's Algorithm. Use Dijkstra's Algorithm to determine the shortest path starting at A. Note that edges without heads are bi-directional To save time, you do not have to add items to the "priority queue" column after it has been discovered (listed in the "distance" column) Use the table below to show your work. What's the shortest route (by weight from A to C