You ARE NOT ALLOWED to modify the given method names. However, if necessary, Question points$)$:

Find the shortest path for starting point is $0$ and assume that finish points are $1,2,3($find each

points shortest path$).$ In the question the output must shown in order. The graph is directed graph.

Sample Output: The example output is:

$01200$

$012440$

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

Important Note: Please do not forget. The result will be contain $2$ point and $1$ value or $3$ point and value.

The starting point is $0$ and the final point is firstly $1,$ secondly $2,$ thirdly $3.$ The shown graph is directed

graph.

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

HW$3\_$Q$2\_$solution: Main body, find the solution of Shortest Path.

$,$ FileRead: read the text file.

Valuefinder: take the value of txt file and convert the integer and create the directed

graph.

$,$ HW$3\_$Q$2$: text file $($I uploaded to the system$)$

In the questions, your explanations are very important.

you may define additional data members and member functions.