(B3). Implement Dijkstra's algorithm on an undirected graph. The input file would contain (1) the pair of source and destination "u v" in the first row, and (2) the edge list with the associated...

Program should be in JAVA

Extracted text: (B3). Implement Dijkstra's algorithm on an undirected graph. The input file would contain (1) the pair of source and destination "u v" in the first row, and (2) the edge list with the associated weight (of type double) for each edge in the graph. Output the sequence of nodes that are on the shortest path from "u" to "v" with the total weight. Provide your own test cases. Turn in your code and test cases (i.e., “.java" or “.c/.cpp" and test files) only. Note: RECURSION is NOT allowed at all. Your implementation can only contain iterative methods.