MCQOPTIONS
Bookmark
Saved Bookmarks
→
Discrete Mathematics
→
Inference in Discrete Mathematics
→
What is the time complexity of Kruskal’s algori..
1.
What is the time complexity of Kruskal’s algorithm?
A.
O(ElogV)
B.
O(V+logE)
C.
O(E+1)
D.
O(V2)
Answer» B. O(V+logE)
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Prim’s algorithm can be implemented using _______
In a maximum spanning tree the weighted graph is of _______
The spanning tree will be maximally acyclic if ____________
A complete undirected graph of n nodes can have maximum ______ spanning trees.
If minimum cost edge of a graph is unique, then that edge will be added to any MST. Choose the correct option.
An immediate application of minimum spanning tree ______
What is the time complexity of Kruskal’s algorithm?
Time complexity of Prim’s algorithm is _________
For every spanning tree with n vertices and n edges what is the least number of different Spanning trees can be formed?
If the weight of an edge e of cycle C in a graph is larger than the individual weights of all other edges of C, then that edge ________
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply