Q43
In a graph with weights, which algorithm helps in constructing a Minimum Spanning Tree (MST)?
A.
Prim's Algorithm or Kruskal's Algorithm
AnswerB.
Dijkstra's Algorithm
C.
Bellman-Ford Algorithm
D.
Floyd-Warshall Algorithm
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board