DM.GT.4.d: Use Dijkstra’s algorithm to determine the shortest spanning tree of a connected graph.