Answer to Question #289007 in C for Rupa

Question

A disjoint -set data structure maintains a collection of disjoint sets. Each set is identified by a representative.

The disjoint-set data structure has the following operations.

   MAKE-SET(x) : Create a set with single tone element x. x will be the representative of the set.

   UNION(x,y): Unite the sets containing x and y, say S_x and S_y into a new set S_x U S_y. This operation destroys S_x and S_y and adds the union.

         Representative of S_x (or S_y) will be the representative of the union.

   FIND-SET(x): Returns the representative of the set S_x.

Implement Disjoint Sets data structure. You should implement the data structure as a disjoint-set forests along with the heuristics union by rank and path compression.

Using the Disjoint-Set data structure implement Krushkal's Algorithm for Minimum Spanning Tree for a weighted undirected graph.

The graph will be passed through a text file as command line argument. You need to display the edges of the MST along with total weight.

Answer 1

Dear Rupa, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order