Q6

  1. Draw the weighted, directed graph corresponding to the adjacency matrix above.
  2. Use Dijkstra’s algorithm on the graph above to calculate the shortest paths from A to all nodes. Show the intermediate calculations as well, not only the final result!