Graph algorithms4

Apply the graph data structure created in my attachment(correct it, because random generation is with errors, it should be that each graph vertex has no more than kmin and no more than kmax vertices neighbours, kmin and max are input as vertices amount number) with graph operations (edge mapping, etc.), random graph generation algorithm, and manual input for weight graph when weights are healthy positive numbers. Use a non-aligned non-oriented graph. Find the minimal covering forest consisting of individual minimum trees Kruskal algorithm. Print the number of individual trees and display the resulting trees separately, either graphically or with vertices with edges. One way to do this is by every union During the operation, track the number of individual components, and the simple way to get a non-union graph - to combine several separately generated graphs. The Kruskal algorithm uses the structure of non-connected set data (disjoint-set data structure) must be fully programmed by you (without using standard packages) structure). Also print the generated graph(manual and random too)