Kruskal’s algorithm is used to              

Related MCQs

• Which of the following edges form minimum spanning tree on the graph using kruskals algorithm?
• Which algorithm is the most efficient numerical algorithm to obtain lcm?
• Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?
• The naive pattern searching algorithm is an in place algorithm.
• Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
• Kruskal’s algorithm is best suited for the dense graphs than the prim’s algorithm.
• Prim’s algorithm resembles Dijkstra’s algorithm.
• Kruskal’s algorithm is best suited for the sparse graphs than the prim’s algorithm.
• The running time of Bellmann Ford algorithm is lower than that of Dijkstra’s Algorithm.
• Dijikstra’s Algorithm is more efficient than Bellmann Ford Algorithm.