Networks

Question 1

What is the first step in Prim’s Algorithm?

Answer 1

Choose any vertex

Question 2

What is the first step in Krushkal’s Algorithm?

Answer 2

Choose the shortest edge

Question 3

What is the second step in Prim’s Algorithm?

Answer 3

Choose the shortest connected edge

Question 4

What is the second step in Kruskal’s Algorithm?

Answer 4

Choose the next shortest edge (does not have to be connected)

Question 5

What’s the difference between Kruskal and Prim?

Answer 5

Prim- Any Vertex—–Krushkal- Smallest Vertex

Prim- Connected edge—– Krushkal- Any edge