Question points$)$:

In the defined system there is one source $(0),$ and $4$ load point $(1,2,3,4).$ In the graph the locations

of the source and load is given find the smallest path of connection to loads and source. $($Minimum

Spanning Tree of the undirected graph$)$

Sample Output:

$V=5$

$E=10$

$0,1120$

$02160$

$03300$

$04450$

$10120$

$12200$

$\{\begin{array}{ccc}\text{:}[1,& 3,& 410]\end{array}$

$\{\begin{array}{ccc}\text{:}[1,& 4,& 500]\end{array}$

$20160$

$\{\begin{array}{ccc}\text{:}[2,& 1,& 200]\end{array}$

$\{\begin{array}{ccc}\text{:}[2,& 3,& 420]\end{array}$

$\{\begin{array}{ccc}\text{:}[2,& 4,& 400]\end{array}$

$30300$

$\{\begin{array}{ccc}\text{:}[3,& 1,& 410]\end{array}$

$\{\begin{array}{ccc}\text{:}[3,& 2,& 420]\end{array}$

$3,4510$

$40450$

$41500$

$42400$ Sample Output:

The Minimum Spanning Tree value $=...$

The Minimum Spanning Tree Path part shows the path for example:

$03300$

$04450$

$12200$

$14500($this is only example not the result$)$

Important Note: If the path contain $0.$ The answer must be:

$04450$

Not $40450$

If the connection is not contain zero the lowest number is written in the path.

$32420$ is not correct.

$23420$ correct.

The Minimum Spanning Tree value for above example The Minimum Spanning Tree value$=...$

The Minimum Spanning Tree Path part shows the path for example:

$03300$

$04450$

$12200$

$14500($this is only example not the result$)$

Important Note: If the path contain $0.$ The answer must be:

$04450$

Not $40450$

If the connection is not contain zero the lowest number is written in the path.

$32420$ is not correct.

$23420$ correct.

The Minimum Spanning Tree value for above example

The Minimum Spanning Tree value $=1450($this is only example not the result$)$

In the question you create $3$ java document and one text file:

HW$3\_$Q$1\_$solution: Main body and the solution of Minimum Spanning Tree question

$,$ FileRead: read the text file.

Valuefinder: take the value of txt file and convert the iCORRECT THIS CODE ACCORDING TO EXPECTED OUTPUT.

$//$ HW$3\_$Q$1\_$solution.java

import java.util.$*$;

public class HW$3\_$Q$1\_$solution $\{$

public static void main$($String$[]$ args$)\{$

FileRead fr $=$ new FileRead$()$;

Valuefinder vf $=$ new Valuefinder$()$;

List lines $=$ fr$.$readFile$("$HW$3\_$Q$1.$txt$")$;

List$>$ graphValues $=$ vf$.$createGraph$($lines$)$;

$//$ Print the original graph representation

System.out.println$("$V$=5")$;

System.out.println$("$E$=10")$;

for $($String line : lines$)\{$

System.out.println$($line$)$;

$\}$

$//$ Minimum Spanning Tree algorithm implementation

List$>$ mst $=$ primMST$($graphValues$)$;

$//$ Print Minimum Spanning Tree Path

System.out.println$("$

The Minimum Spanning Tree Path"$)$;

printMSTPath$($mst$)$;

$//$ Calculate and print the total weight of the Minimum Spanning Tree

int mstValue $=$ calculateMSTValue$($mst$)$;

System.out.println$("$

The Minimum Spanning Tree value$="+$ mstValue$)$;

$\}$

$//$ Implement your Minimum Spanning Tree algorithm here

private static List$>$ primMST$($List$>$ graph$)\{$

$//$ Your implementation goes here

return new ArrayList; $//$ Replace this with your result

$\}$

$//$ Print the Minimum Spanning Tree Path

private static void printMSTPath$($List$>$ mst$)\{$

for $($List edge : mst$)\{$

for $($int i $=0$; i $$ edge.size$()$; i$++)\{$

System.out.print$($edge$.$get$($i$)+"")$;

$\}$

System.out.println$()$;

$\}$

$\}$

$//$ Calculate the value of the Minimum Spanning Tree

private static int calculateMSTValue$($List$>$ mst$)\{$

$//$ Your implementation goes here

return $0$; $//$ Replace this with your result

$\}$

$\}$

$//$ FileRead.java

import java.io$.*$;

import java.util.$*$;

public class FileRead $\{$

public List readFile$($String fileName$)\{$

List lines $=$ new ArrayList;

try $($BufferedReader br $=$ new BufferedReader$($new FileReader$($fileName$)))\{$

String line;

while $(($line $=$ br$.$readLine$())!=$ null$)\{$

lines.add$($line$)$;

$\}$

$\}$ catch $($IOException e$)\{$

e$.$printStackTrace$()$;

$\}$

return lines;

$\}$

$\}$

$//$ ValueFinder.java

import java.util.$*$;

public class Valuefinder $\{$

public List$>$ createGraph$($List lines$)\{$

List$>$ graph $=$ new ArrayList;

for $($String line : lines$)\{$

String$[]$ parts $=$ line.split$("")$;

List edge $=$ new ArrayList;

for $($String part : parts$)\{$

edge.add$($Integer$.$parseInt$($part$))$;

$\}$

graph.add$($edge$)$;

$\}$

return graph;

$\}$

$\}$

$---$ Program output $---$

V$=5$

E$=10$

$5$

$10$

$01120$

$02160$

$03300$

$04450$

$12200$

$13410$

$14500$

$23420$

$24400$

$34510$

The Minimum Spanning Tree Path

The Minimum Spanning Tree value$=0$

$---$ Expected output $($text$)---$

V$=5$

E$=10$

$01120$

$02160$

$03300$

$04450$

$10120$

$12200$

$13410$

$14500$

$20160$

$21200$

$23420$

$24400$

$30300$

$31410$

$32420$

$34510$

$40450$

$41500$

$42400$

$43510$

The Minimum Spanning Tree Path

$01120$

$02160$

$03300$

$24400$

The Minimum Spanning Tree value$=980$