MCQOPTIONS
Bookmark
Saved Bookmarks
→
Kruskals Algorithm Multiple Choice
→
General
→
Kruskal s algorithm is best suited for the dense g...
1.
Kruskal s algorithm is best suited for the dense graphs than the prim s algorithm.
A.
True
B.
False
Answer» C.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Consider the following statements.S1. Kruskal s algorithm might produce a non-minimal spanning tree.
Kruskal s algorithm is best suited for the dense graphs than the prim s algorithm.
Which of the following is false about the Kruskal s algorithm?
What is the time complexity of Kruskal s algorithm?
Kruskal s algorithm is a ______
Kruskal s algorithm is used to ______
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies
