10. Prims Algorithm Run Prims algorithm on the graph below, with start vertex a. Assume that vertices are ordered alphabetically List the vertex removed from the priority queue under the column RM for each step. In addition, you should fill in for each vertex its key value in the priority queue (use a - for nodes which are no longer in the prioity queue) 0 3 5 10 7 15 17 1 15 9 8

10. Prim’s Algorithm Run Prims algorithm on the graph below, with start vertex a. Assume that vertices are ordered alphabetically List the vertex removed from the priority queue under the column RM for each step. In addition, you should fill in for each vertex it’s key value in the priority queue (use a “-” for nodes which are no longer in the prioity queue) 0 3 5 10 7 15 17 1 15 9 8



Source link

Leave a Reply

Your email address will not be published. Required fields are marked *