Added comment to dijsktra algorithm

Author: edujtm

Algorithms/Graph Algorithms/Shortest Path Algorithm/Dijkstra's Algorithm/Python/dijkstra.py

@@ -41,6 +41,8 @@ def dijsktra(adj, vert):
     distance = [0] * len(adj[vert])
     processed = [False] * len(adj[vert])
 
+	# Initializes the distance array of initial vertex with values from the adjacency matrix
+	# if the edge is unexistent (-1), sets the distance as maxsize
     for i in range(len(adj[vert])):
         if adj[vert][i] == -1:
             distance[i] = sys.maxsize
@@ -114,4 +116,4 @@ def test_directed():
     printSolution(shortest)
 
 test_undirect()
-test_directed()
+test_directed()