2 votes 2 votes Consider the given graph Its Minimum Cost Spanning Tree is ______ Graph Theory ugcnetcse-june2015-paper2 graph-theory minimum-spanning-tree + – go_editor asked Jul 30, 2016 • edited Jan 19, 2023 by makhdoom ghaya go_editor 3.1k views answer comment Share Follow See 1 comment See all 1 1 comment reply papesh commented Jul 30, 2016 i moved by papesh Sep 24, 2016 reply Follow Share B. Is ans... Option A and C is eliminated since not having 1-6 edge... D is eliminated since it contains edge weight 28 Even we have choice for smaller edge weight... 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes finding MST using Kruskal’s algorithm steps as follow: 1. Sort all the edges in non-decreasing order of their weight. 2. Pick the smallest edge. Check if it forms a cycle with the spanning tree formed so far. If cycle is not formed, include this edge. Else, discard it. 3. continue step 2 until we have (V-1) edges in the spanning tree. Hira Thakur answered Nov 15, 2017 Hira Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.