Question
Download Solution PDFThe weight of minimum spanning tree in graph G, calculated using Kruskal’s algorithm is:
Answer (Detailed Solution Below)
Detailed Solution
Download Solution PDFConcept:
A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges(V – 1 ) of a connected, edge-weighted undirected graph G(V, E) that connects all the vertices together, without any cycles and with the minimum possible total edge weight.
Explanation:
Edge set for the given graph = {2, 3, 4, 5, 6, 7, 8}
For 5 vertices, we need 4 edges in MST,
So, edge set for MST = {2, 3, 4, 6}
Minimum spanning tree
Minimum cost 2 + 3 + 4 + 6 = 15
Last updated on Jun 12, 2025
-> The UGC NET June 2025 exam will be conducted from 25th to 29th June 2025.
-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.
-> The exam is conducted bi-annually - in June and December cycles.
-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions.
-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.