Q60
Which of the following is not the algorithm to find the minimum spanning tree of the given graph?
A.
Boruvka's algorithm
B.
Prim's algorithm
C.
Kruskal's algorithm
D.
Bellman-Ford algorithm
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board