Which of the following is not the algorithm to find the minimum spanning tree of the given graph?

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Design and Analysis of Algorithms

Q. 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

💬 Discuss

✅ Correct Answer: (D) bellman–ford algorithm

Explanation: the boruvka’s algorithm, prim’s algorithm and kruskal’s algorithm are the algorithms that can be used to find the minimum spanning tree of the given graph. the bellman-ford algorithm is used to find the shortest path from the single source to all other vertices.

Explanation by: Mr. Dubey

the boruvka’s algorithm, prim’s algorithm and kruskal’s algorithm are the algorithms that can be used to find the minimum spanning tree of the given graph. the bellman-ford algorithm is used to find the shortest path from the single source to all other vertices.

💬 Discussion

📊 Question Analytics

👁️

373

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

89%

Success Rate