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