Hide text Hide pseudo-code | |

Apply the algorithm to the following weighted graph (represented as an adjacency list beside the graphical representation) to construct the minimum spanning tree of the graph. The spanning tree is already initialized with the root vertex A, and thus does not containt the edge (A.father, A). Some additional problems. | |

MST-Prim(G,root) // G = (V,E,W) |