[solved]-Use Kruskal S Algorithm Find Minimum Spanning Tree Similar Format Examples Mark Found Tree Q39033626
Use Kruskal’s Algorithm to find some minimum spanning tree tosimilar format of the examples. Mark the found tree via bold (andsome color, if possible) on the drawing page. From the input file,select edges that belong to the found tree and copy such edges tothe output text file. At the output file end, add a line describingthe found tree total weight.
So, at the end, you are supposed to submit four files – two pdffiles (drawings depicting the weighted graphs together with theirminimum spanning trees) and two matching text files (describing theedges of the trees).
Example inputs:
Example outputs:
Assignment input files:
in2 (requires 1 output drawing and text file):
In3 (requires 1 output drawing file and 1 output text file):
We were unable to transcribe this imageFor example Graph vertices A-, B-1,C=2,-3, E-4, F-5 Graph edges: verticei, vertice, weight of the edge edge: 0, 1, 4 edge: 0, 2, 1 edge: 1, 2, 3 edge: 1, 3, 6 edge: 1, 4, 5 edge: 1, 5, 4 edge: 2, 3, 4 edge: 3, 4, 2 edge: 3, 5, 3 edge: 4, 5, 2 Kruskal spanning tree edges: verticel, vertice2, weight of the edge edge: 0, 2, 1 edge: 3, 4, 2 edge: 4, 5, 2 edge: 1, 2, 3 edge: 1, 5, 4 Kruskal spanning tree weight is 12 For Example Graph vertices A=0, B-1, C=2,0=3, E-4,F=5 Graph edges: verticei, vertice2, weight of the edge edge: 0, 1, 4 edge: 0, 2, 1 edge: 1, 2, 3 edge: 1, 3, 6 edge: 1, 4, 5 edge: 1, 5, 4 edge: 2, 3, 4 edge: 3, 4, 2 edge: 3, 5, 3 edge: 4, 5, 2 Kruskal spanning tree edges: verticei, vertice2, weight of the edge edge: @, 2, 1 edge: 3, 4, 2 edge: 4, 5, 2 edge: 1, 2, 3 edge: 1, 5, 4 Kruskal spanning tree weight is 12 outExample_edges.txt – Notepad File Edit Format View Help Graph edges: vertice1, vertice2, weight of the edge edge: 0, 1, 4 edge: 0, 2, 1 edge: 1, 2, 3 edge: 1, 3, edge: 1, 4, 5 edge: 1, edge: 2, 3, 4 edge: 3, 4, edge: 3, 5, edge: 4, 5, 2 in Kruskal spanning tree edges: verticel, vertice2, weight of the edge edge: 0, 2, 1 edge: 3, 4, 2 edge: 4, 5, 2 edge: 1, 2, 3 edge: 1, 5, 4 Kruskal spanning tree weight is 12 in23_graph.pdf 1/1 in2 edges.txt – Notepad File Edit Format View Help Graph edges: verticel vertice2 weight_of_the_edge 0 14 0 2 1 1 27 1 3 3 wwwN 364 4.79 4 88 5 6 7 5 10 12 5 11 3 675 6 12 11 7 8 4 7 15 3 8 97 8 13 11 8 14 5 9 27 6 10 11 5 10 18 7 11 15 2 11 23 4 12 13 5 13 16 4 14 25 8 15 16 5 15 21 1 16 25 6 17 18 4 18 19 3 19 20 6 in2 edges.txt – Notepad File Edit Format View 19 20 6 19 22 7 20 25 2 21 24 8 21 25 4 22 23 5 22 24 6 25 27 3 25 37 1 26 27 1 26 28 7 27 28 5 27 298 28 33 3 29 30 2 29 38 4 29 39 7 30 31 3 30 35 4 31 32 4 33 34 6 33 39 5 34 35 7 34 36 4 35 36 8 35 40 11 36 42 5 37 43 9 37 44 8 38 41 10 38 43 3 39 40 4 39 41 6 40 42 3 41 42 7 40 42 3 41 427 41 42 42 455 42 48 4 43 446 44 46 11 45 46 12 45 47 18 46 479 47 483 in3_edges.txt – Notepad File Edit Format View Help Graph edges: verticel vertice2 weight_of_the_edge 0 14 0 2 1 1 27 1 3 3 wwwN 364 4.79 4 88 5 6 7 5 10 12 5 11 3 675 6 12 11 7 8 4 7 15 3 8 9 8 8 13 11 8 14 5 9 27 6 10 11 3 10 18 7 11 15 2 11 23 3 12 13 5 13 16 4 14 25 8 15 16 3 15 21 1 16 25 5 17 18 4 18 19 3 19 296 Help in3_edges.txt – Notepad File Edit Format View 19 20 6 19 22 7 20 25 2 21 24 8 21 25 4 22 23 5 22 24 6 25 27 3 25 37 2 26 27 1 26 28 7 27 28 5 27 29 6 28 33 3 29 30 2 29 38 4 29 39 7 30 31 2 30 35 3 31 32 4 33 34 3 33 39 5 34 35 7 34 36 4 35 36 8 35 40 3 36 42 5 37 43 9 37 44 8 38 41 10 38 43 3 39 40 4 39 41 6 40 42 3 41 42 7 40 42 3 427 41 44 2 42 455 42 48 4 43 446 44 468 45 46 12 45 47 18 46 479 47 483 Show transcribed image text
For example Graph vertices A-, B-1,C=2,-3, E-4, F-5 Graph edges: verticei, vertice, weight of the edge edge: 0, 1, 4 edge: 0, 2, 1 edge: 1, 2, 3 edge: 1, 3, 6 edge: 1, 4, 5 edge: 1, 5, 4 edge: 2, 3, 4 edge: 3, 4, 2 edge: 3, 5, 3 edge: 4, 5, 2 Kruskal spanning tree edges: verticel, vertice2, weight of the edge edge: 0, 2, 1 edge: 3, 4, 2 edge: 4, 5, 2 edge: 1, 2, 3 edge: 1, 5, 4 Kruskal spanning tree weight is 12
For Example Graph vertices A=0, B-1, C=2,0=3, E-4,F=5 Graph edges: verticei, vertice2, weight of the edge edge: 0, 1, 4 edge: 0, 2, 1 edge: 1, 2, 3 edge: 1, 3, 6 edge: 1, 4, 5 edge: 1, 5, 4 edge: 2, 3, 4 edge: 3, 4, 2 edge: 3, 5, 3 edge: 4, 5, 2 Kruskal spanning tree edges: verticei, vertice2, weight of the edge edge: @, 2, 1 edge: 3, 4, 2 edge: 4, 5, 2 edge: 1, 2, 3 edge: 1, 5, 4 Kruskal spanning tree weight is 12
outExample_edges.txt – Notepad File Edit Format View Help Graph edges: vertice1, vertice2, weight of the edge edge: 0, 1, 4 edge: 0, 2, 1 edge: 1, 2, 3 edge: 1, 3, edge: 1, 4, 5 edge: 1, edge: 2, 3, 4 edge: 3, 4, edge: 3, 5, edge: 4, 5, 2 in Kruskal spanning tree edges: verticel, vertice2, weight of the edge edge: 0, 2, 1 edge: 3, 4, 2 edge: 4, 5, 2 edge: 1, 2, 3 edge: 1, 5, 4 Kruskal spanning tree weight is 12
in23_graph.pdf 1/1
in2 edges.txt – Notepad File Edit Format View Help Graph edges: verticel vertice2 weight_of_the_edge 0 14 0 2 1 1 27 1 3 3 wwwN 364 4.79 4 88 5 6 7 5 10 12 5 11 3 675 6 12 11 7 8 4 7 15 3 8 97 8 13 11 8 14 5 9 27 6 10 11 5 10 18 7 11 15 2 11 23 4 12 13 5 13 16 4 14 25 8 15 16 5 15 21 1 16 25 6 17 18 4 18 19 3 19 20 6
in2 edges.txt – Notepad File Edit Format View 19 20 6 19 22 7 20 25 2 21 24 8 21 25 4 22 23 5 22 24 6 25 27 3 25 37 1 26 27 1 26 28 7 27 28 5 27 298 28 33 3 29 30 2 29 38 4 29 39 7 30 31 3 30 35 4 31 32 4 33 34 6 33 39 5 34 35 7 34 36 4 35 36 8 35 40 11 36 42 5 37 43 9 37 44 8 38 41 10 38 43 3 39 40 4 39 41 6 40 42 3 41 42 7
40 42 3 41 427 41 42 42 455 42 48 4 43 446 44 46 11 45 46 12 45 47 18 46 479 47 483
in3_edges.txt – Notepad File Edit Format View Help Graph edges: verticel vertice2 weight_of_the_edge 0 14 0 2 1 1 27 1 3 3 wwwN 364 4.79 4 88 5 6 7 5 10 12 5 11 3 675 6 12 11 7 8 4 7 15 3 8 9 8 8 13 11 8 14 5 9 27 6 10 11 3 10 18 7 11 15 2 11 23 3 12 13 5 13 16 4 14 25 8 15 16 3 15 21 1 16 25 5 17 18 4 18 19 3 19 296
Help in3_edges.txt – Notepad File Edit Format View 19 20 6 19 22 7 20 25 2 21 24 8 21 25 4 22 23 5 22 24 6 25 27 3 25 37 2 26 27 1 26 28 7 27 28 5 27 29 6 28 33 3 29 30 2 29 38 4 29 39 7 30 31 2 30 35 3 31 32 4 33 34 3 33 39 5 34 35 7 34 36 4 35 36 8 35 40 3 36 42 5 37 43 9 37 44 8 38 41 10 38 43 3 39 40 4 39 41 6 40 42 3 41 42 7
40 42 3 427 41 44 2 42 455 42 48 4 43 446 44 468 45 46 12 45 47 18 46 479 47 483
Expert Answer
Answer to Use Kruskal’s Algorithm to find some minimum spanning tree to similar format of the examples. Mark the found tree via … . . .
OR
