can anybody help me solve this Kruskal’s algorithm.
Use Kruskal’s algorithm to find a minimum spanning tree for the network shown
below. You must clearly state the order in which you select the arcs of the tree.
Draw the minimum spanning tree using the vertices and state the weight of the
tree.
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.