Prim's Algorithm

All are other name of Prim's Algorithm. EXCEPT

• Prim-jarnik Algorithm
• Prim model algorithm
• DJP algorithm
• Jarnik's Algorithm

What is the first step if a given graph contains a loop?

• Remove all loops
• Identify the edge that has a minimum weight
• Continue and select a root node
• Count all the loops and draw a graph

If two vertices has parallel edges the edge that has a minimum weight will be remove.

• TRUE
• FALSE

A graph can only have one(1) spanning tree.

• TRUE
• FALSE

In solving the weight of a minimum spanning tree you should subtract the weight of all edges.

• TRUE
• FALSE

What is the weight of the Minimum Spanning tree?

• 2
• 6
• 3
• 8

What is the weight of the Minimum Spanning tree?

• 17
• 16
• 15
• 14

What is the weight of the Minimum Spanning tree?

• 13
• 17
• 19
• 21

What is the weight of the Minimum Spanning tree?

• 1
• 44
• 17
• 22

What is the weight of the Minimum Spanning tree?

• 12
• 17
• 14
• 15