Which of the following is not the algorithm to find the minimum spanning tree of the given graph?
|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.|
Login to Continue
It will take less than 2 minutes