Computer scienceProgramming languagesJavaInterview preparationAlgorithms and problem solving techniques

Minimum spanning tree problem - Prim and Kruskal algorithms

Common attributes

Report a typo

Choose the correct attributes for both Prim's and Kruskal's algorithms.

Select one or more options from the list

Both start by selecting a node

Both have complexity O(M log M), where M is the number of edges

Both can be used for weighted or unweighted graphs

Both are guaranteed to solve MST problem

___

Create a free account to access the full topic