Function Dijkstra

Graphs/dijkstra_2.py:21–36

(graph, V, src)

	return minInd

def Dijkstra(graph, V, src):
	mdist=[float('inf') for i in range(V)]
	vset = [False for i in range(V)]
	mdist[src] = 0.0
	
	for i in range(V-1):
		u = minDist(mdist, vset, V)
		vset[u] = True
		
		for v in range(V):
			if (not vset[v]) and graph[u][v]!=float('inf') and mdist[u] + graph[u][v] < mdist[v]:
				mdist[v] = mdist[u] + graph[u][v] 

	

	printDist(mdist, V)