268.WHAT IS SPANNING TREE ?HOW DO U CALCULATE?
A spanning tree of a connected graph G can also be defined as a maximal set of edges of G that contains no cycle, or as a minimal set of edges that connect all vertices.
IN ORDER TO CALCULATE ADD ALL THE WEIGHTS THAT IS CONNECTING ALL VERTICES WITH MINIMUM WEIGHT THAT IS CALLED MINIMAL SPANNING TREE.
A spanning tree of a connected graph G can also be defined as a maximal set of edges of G that contains no cycle, or as a minimal set of edges that connect all vertices.
IN ORDER TO CALCULATE ADD ALL THE WEIGHTS THAT IS CONNECTING ALL VERTICES WITH MINIMUM WEIGHT THAT IS CALLED MINIMAL SPANNING TREE.
No comments:
Post a Comment