The objective of this assignment is to practice and implement Dijkstra's shortest path algorithm.

Problem Specification:

Write a Java program to create a simple directed graph,

G

$=$

$($V

$,$

E$)$

$,$

$$where

V

$$is a set of vertices

and and

x

$!=$

y

$,$

$$a set of edges. Use adjacency matrix to implement and

represent your graph. Then implement Dijkstra's shortest path algorithm on the generated graph.

Your program should print all the distances from a source vertex

$($s$)$

$$and the paths to all the vertices