DATA STUCTURES AND ALGORITHMS C++ Consider the following weighted undirected graph and draw two Minimum Spanning Trees (MST) using Kruskal’s and Prim’s Algorithms. Compare both MSTs and tell either...

DATA STUCTURES AND ALGORITHMS C++

Consider the following weighted undirected graph and draw two Minimum Spanning Trees (MST) using Kruskal’s and Prim’s Algorithms.

Compare both MSTs and tell either the total weight of both MSTs are same or which algorithm provides a minimum weighted MST.

Extracted text: 0.29 0.32 3 0.36 5 0.28 0.34 2 0.26 0.40 0.58 0.38 6 0.93 4 0.35 0.37 0.16 0.17 0.52