$11$:$31$

$28$

Assignment $5(2).$docx

Assignment $5$

In this assignment, you will implement Dijkstra's algorithm method to find the shortest paths from a source vertex to all other vertices based on the given weighted graph $.$

Implementation Steps:

Initialize the distance array dis with Integer.MAX$\_$VALUE for all vertices except the source vertex, which should be initialized to $0.$

Initialize a visited array to keep track of visited vertices.

$-$While there are unvisited vertices:

Select the unvisited vertex with the smallest known distance.

Update the distance to its neighbors if a shorter path is found.

Mark the selected vertex as visited.