In Java, please use the addEdge function to add the edge.
Implement Dijkstra's algorithm to find the shortest path from
vertex 0 to all other vertices in the graph below. Use the
adjacency list representation to store and use the graph in memory.
Do not use any other representation.
Use vertex 'A' as your source vertex (begin the algorithm from
A).
Your output should be in the following format with the second
column filled out. The distance from the source vertex (second
column) is the sum of weights on the shortest path from the source
vertex (A) to the particular vertex:
Vertex Distance from source vertex
A
B
C
D
E
F
G
H
I
B
C
D
-
E
A
H
G
F