- B Find Mst For Ug By Kruskal Method Description Given A Connected Ug You Are Required To Design A Function Like Int Ms 1 (278.95 KiB) Viewed 39 times
- B Find Mst For Ug By Kruskal Method Description Given A Connected Ug You Are Required To Design A Function Like Int Ms 2 (342.93 KiB) Viewed 39 times
the subject is DSA course and this is a code practice for MST i also uploaded the input and output with examples
B. Find MST for UG by Kruskal method Description Given a connected UG, you are required to design a function like int MST_Kruskal (AdjList*G), which determine the MST of a UG and return the path length of it. Here is adjaceceny List for UG: const int MAXV= 50 typedef struct_edgeNode { int adi; int w; _edgeNode *next; } EdgeNode typedef struct VertexNode{ char data[10] EdgeNode *head; } VertexNode, typedef struct { VertexNode vertex[MAXV]. int vn en; }AdiList Input first line enter 2 numbers for(nyne) second line enter the all vertex data (such ABCD.) start from third line, enter edge information, each edge is in form of v1 v2 w Where v1 is starting vertex and v2 is end Vertex data, wis weight of the edge separated by space. Output Output the result in one line which is the path length of MST:
Examples input A B C D E F G A B 6 A D 4 B C 7 B E 6 DE 14 F G 10 F E 7 E C 4 output A D 4 E ( 4 D F5 A B 6 B E 6 E G 6 31 input 4 6 A B C D ACB DB 11 CB3 DC 7 output DA 2 AC3 с в 3 8