Using the array-list implementation for directed graphs, create the class Graph and utilize Dijkstra shortest path algorithm that finds shortest paths from the source vertex to the destination vertex output must give desired results using the specified data structures and algorithms.edges specified in the main.java

main.java

Desired output

Suggested Classes:

Main: to insert the data to be run and to print results

Node: to define the Node object

Edge: to define the edge object

Graph: to do array-based implementation of graph data structure and solving our shortest path problem with Dijkstra algorithm

also provide a puesdocode and a UML Diagram

public class Main \{ public static void main(String[] args) \{ //inserting data to be run Edge [] edges ={ new Edge(0,2,1), new Edge(0,3,4), new Edge(0,4,2), new Edge(0,1,3), new Edge(1,3,2), new Edge(1,4,3), new Edge(1, 5, 1), new Edge(2,4,1), new Edge(3,5,4), new Edge(4, 5, 2), new Edge(4,6,7), new Edge(4,7,2), new Edge(5,6,4), new Edge(6,7,5) \}; Graph g = new Graph(edges); g. calculateShortestDistances (); g.printResult (); \} \} Number of nodes =8 Number of edges =14 shortest distance from node to node is shortest distance from node 0 to node 1 is 3 shortest distance from node 0 to node 2 is 1 shortest distance from node 0 to node 3 is 4 shortest distance from node 0 to node 4 is 2 shortest distance from node 0 to node 5 is 4 shortest distance from node 0 to node 6 is 8 shortest distance from node 0 to node 7 is 4