Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by sandeepn96
0
votes
1
UGC NET CSE | December 2018 | Part 2 | Question: 12
Consider the graph shown below: Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is $17$ $14$ $16$ $13$
Consider the graph shown below:Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is$17$$14$$16$$13$
4.4k
views
answered
Jan 2, 2019
Unknown Category
ugcnetcse-dec2018-paper2
algorithms
minimum-spanning-tree
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register