Apply the Dijkstra/Prim Minimum Spanning Tree algorithm (not Shortest Paths) on the following graph starting at vertex a:
The tables for you to fill in are available in the file: dij2.pdf (click to download). Use the tables to indicate the values of the data structures at each step of the algorithm. To ease readability and speed up marking: once a vertex is added to the tree, its values for tree, min_wt, and closest below do not change further. Instead of recopying at each step, just draw a line through the remaining boxes to indicate that the values stay the same.
Mark the edges of the graph which are in the MST.
tree[v]- set to T if the vertex v is in the tree and F otherwise.
min_wt[v]- records the weight of a minimum weight edge from a tree vertex to v for each v not in the tree.
At the end of this algorithm, the value of min_wt[v] will be the weight of the edge used to connect v into the tree.
closest[v]- records the closest tree vertex to each vertex v which is not in the tree.
At the end of this algorithm, the value of closest[v] will be u where (u, v) is the edge used to connect v into the tree.