00:01
We're asked to devising an algorithm similar to prims algorithm for constructing a maximum spanning tree of a connected weighted graph.
00:10
We're told that a maximum spanning tree of connected, weighted, undirected graph is a spanning tree with the largest possible weight.
00:18
So instead of minimizing the weights, now we're maximized.
00:23
Now in this problem, the answer is given in pseudocode.
00:28
However, i'm not familiar with pseudocode.
00:30
I don't know if the reader is.
00:31
If you are, i would suggest that you take the answer that i'm going to give here and translate it into pseudocode yourself.
00:40
But either way, i think the most important thing is not to know how to read pseudocode, but really how to adapt primm's algorithm for solving this problem...
