Analysis of Algorithm and java programing

Create a random graph, implement Dijkstra’s algorithm to return the widest path between two nodes (these two nodes should be entered from keyboard). For example, suppose we have the following random graph: Node list: {1,2,3,4,5} Edge list: {(1,2,3),(2,3,4),(3,5,5),(1,4,1),(4,5,2)} Each edge in the edge list has the form (vs,vd,w) with the meaning that an edge connects node vs and vd, and the edge weight is w. Then for the above graph, the widest path from node 1 to 5 is path 1−2−3−5 and the path weight is 3.