document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=1161148>Question 1161148</A>: <I><SPAN STYLE=\"word-break: break-all;\"> Is it B? I want to check my answer.\r<BR>\n" );
document.write( "\n" );
document.write( "Which is the cost of the minimum spanning tree of the weighted graph using Kruskal's Algorithm? \r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "A. 28\r<BR>\n" );
document.write( "\n" );
document.write( "B. 30\r<BR>\n" );
document.write( "\n" );
document.write( "C. 31\r<BR>\n" );
document.write( "\n" );
document.write( "D. 40\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "the question is provided in the link here: https://i.imgur.com/zzzvcG9.png </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #784730 by </B><A HREF=/tutors/aboutme.mpl?userid=Theo><B>Theo(13342)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=Theo><IMG SRC=http://www.algebra.com/images/aboutme-small.gif BORDER=0 alt=\"About Me\" VALIGN=MIDDLE></A>&nbsp;<IMG SRC=http://www.algebra.com/cgi-bin/show-face.mpl?user=Theo><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=784730\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> i get 28 using kruskal.<BR>\n" );
document.write( "i also used prim and got the same answer.<BR>\n" );
document.write( "using kruskal i did the following:<BR>\n" );
document.write( "i looked for the link with a weight of 1.<BR>\n" );
document.write( "that was link AB.<BR>\n" );
document.write( "i then looked for a link with a weight of 2.<BR>\n" );
document.write( "that was link DF.<BR>\n" );
document.write( "it was not connected to node A or B, so i drew it separate.<BR>\n" );
document.write( "i then looked for a link with a weight of 3.<BR>\n" );
document.write( "that was link EH.<BR>\n" );
document.write( "it was not connected to node A or B or D or F, so i drew it separate.<BR>\n" );
document.write( "i then looked for a link with a weight of 4.<BR>\n" );
document.write( "that was link HG.<BR>\n" );
document.write( "it was connected to node H, so i drew it connected there.<BR>\n" );
document.write( "so far my nodes were ABDFEHG<BR>\n" );
document.write( "i then looked for a link with a weight of 5.<BR>\n" );
document.write( "that was link BG.<BR>\n" );
document.write( "it was connected to node B, so i drew it connected there.<BR>\n" );
document.write( "i then looked for a link with a weight of 6.<BR>\n" );
document.write( "that was link AC.<BR>\n" );
document.write( "it was connected to node A so i drew it connected there.<BR>\n" );
document.write( "i then looked for a link with a a weight of 7.<BR>\n" );
document.write( "that was link CD.<BR>\n" );
document.write( "it was connected to node C, so i drew it connected there.<BR>\n" );
document.write( "i then looked for a link with a weight of 8.<BR>\n" );
document.write( "that was link BD.<BR>\n" );
document.write( "it was connected to node B and D forming a cycle (closed loop) so i rejected it.<BR>\n" );
document.write( "i then looked for a link with a weight of 9.<BR>\n" );
document.write( "that was link CE.<BR>\n" );
document.write( "it was connected to node C and E forming a cycle, so i rejected it.<BR>\n" );
document.write( "i then looked for a link with a weight of 10.<BR>\n" );
document.write( "that was link GF.<BR>\n" );
document.write( "it was connected to node G and F forming a cycle, so i rejected it.<BR>\n" );
document.write( "i then looked for a link with a weight of 11.<BR>\n" );
document.write( "that was link EF.<BR>\n" );
document.write( "that was connected to node E and F forming a cycle, so i rejected it.<BR>\n" );
document.write( "that was the end of it.<BR>\n" );
document.write( "my spanning tree was, starting from node E.<BR>\n" );
document.write( "EH with a weight of 3.<BR>\n" );
document.write( "HG with a weight of 4.<BR>\n" );
document.write( "BG with a weight of 5<BR>\n" );
document.write( "AB with a weight of 1<BR>\n" );
document.write( "AC with a weight of 6<BR>\n" );
document.write( "CD with a weight of 7<BR>\n" );
document.write( "DF with a weight of 2<BR>\n" );
document.write( "there were all 8 nodes from the weighted graph.<BR>\n" );
document.write( "there were 7 links connected them.<BR>\n" );
document.write( "the spanning tree had a total weight of 28. *****<BR>\n" );
document.write( "that, i believe, should be your answer.<BR>\n" );
document.write( "here's my diagram of what i drew.<BR>\n" );
document.write( "it pays to string them out and leave enough space for the one that aren't connected initially so you can see the actual paths clearly.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "<IMG STYLE=\"max-width:80%;\" src = \"http://theo.x10hosting.com/2020/061701.jpg\" >\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "check your paths again, and draw them out to see why you got 30 rather than 28.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "if you get a link that connects to two nodes that you already drew, that forms a cycle and need to be rejected.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "here's some references you might find helpful for both kruskal and prin.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "<a  rel=nofollow HREF= \"https://www.youtube.com/watch?v=4ZlRH0eK-qQ\" target = \"_blank\">https://www.youtube.com/watch?v=4ZlRH0eK-qQ</a>\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "<a  rel=nofollow HREF= \"https://www.tutorialspoint.com/data_structures_algorithms/spanning_tree.htm\" target = \"_blank\">https://www.tutorialspoint.com/data_structures_algorithms/spanning_tree.htm</a>\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "<a  rel=nofollow HREF= \"https://www.tutorialspoint.com/data_structures_algorithms/kruskals_spanning_tree_algorithm.htm\" target = \"_blank\">https://www.tutorialspoint.com/data_structures_algorithms/kruskals_spanning_tree_algorithm.htm</a>\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "<a  rel=nofollow HREF= \"https://www.tutorialspoint.com/data_structures_algorithms/prims_spanning_tree_algorithm.htm\" target = \"_blank\">https://www.tutorialspoint.com/data_structures_algorithms/prims_spanning_tree_algorithm.htm</a>\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "prim and kruskal will get the same answer for this problem.<BR>\n" );
document.write( "since this was the first time i had to do a problem like this, i had many trials and errors until i gelled on the right procedure.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "check it out and verify that 28 should be the correct answer.<BR>\n" );
document.write( "let me know if you still think otherwise.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( " </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );