Suppose that you implement PrimMST but instead of using a priority queue to find the next vertex to add to the tree, you scan through all Ventries in the distTo[] array to find the non-tree vertex with the smallest weight. What would be the order of growth of the running time for graphs with Vvertices and Eedges? When would this method be appropriate, if ever? Defend your answer.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.