What 2 people have algorithms for minimum spinning trees
Kruskles and prims
What is a minimum spanning tree topic include
Moving around grasp an spanning trees
What is the difference between prims and kruskels
Kruskels have to be connected at all times where as prims you chose the smallest weight from anywhere
What must you look out for in kruskels algorithm
That you do not form cycles
How will you know that you have the right number of vertex when forming a scanning tree (formula)
(n-1) edges to form a scanning tree
Which of the two people are you able to to use the table
Prims