Merge branch 'tests/doctests-dijkstra_2' of https://github.com/PranavTamada/Python into tests/doctests-dijkstra_2

Author: PranavTamada

graphs/dijkstra_2.py

@@ -1,47 +1,47 @@
 def print_dist(dist, v):
-	"""
-	Print vertex distances.
-	>>> print_dist([0.0, 5.0, 8.0, 9.0], 4)
-	Vertex Distance
-	0    0
-	1    5
-	2    8
-	3    9
-	>>> print_dist([0.0, float('inf')], 2)
-	Vertex Distance
-	0    0
-	1    INF
-	>>> print_dist([0.0], 1)
-	Vertex Distance
-	0    0
-	"""
-	print("Vertex Distance")
-	for i in range(v):
-		if dist[i] != float("inf"):
-			print(i,"  ", int(dist[i]))
-		else:
-			print(i,"  ", "INF")
+    """
+    Print vertex distances.
+    >>> print_dist([0.0, 5.0, 8.0, 9.0], 4)
+    Vertex Distance
+    0    0
+    1    5
+    2    8
+    3    9
+    >>> print_dist([0.0, float('inf')], 2)
+    Vertex Distance
+    0    0
+    1    INF
+    >>> print_dist([0.0], 1)
+    Vertex Distance
+    0    0
+    """
+    print("Vertex Distance")
+    for i in range(v):
+        if dist[i] != float("inf"):
+            print(i, "  ", int(dist[i]))
+        else:
+            print(i, "  ", "INF")
 
 
 def min_dist(mdist, vset, v):
-	"""
-	Finds the vertex with minimum distance that hasn't been visited yet.
-	>>> min_dist([0, 4, 2, float('inf')], [True, False, False, False], 4)
-	2
-	>>> min_dist([0, 4, 2, 1], [True, False, True, False], 4)
-	3
-	>>> min_dist([0, 4, 2, 1], [True, True, True, True], 4)
-	-1
-	>>> min_dist([float('inf'), float('inf')], [False, False], 2)
-	-1
-	"""
-	min_val = float("inf")
-	min_ind = -1
-	for i in range(v):
-		if (not vset[i]) and mdist[i] < min_val:
-			min_ind = i
-			min_val = mdist[i]
-	return min_ind
+    """
+    Finds the vertex with minimum distance that hasn't been visited yet.
+    >>> min_dist([0, 4, 2, float('inf')], [True, False, False, False], 4)
+    2
+    >>> min_dist([0, 4, 2, 1], [True, False, True, False], 4)
+    3
+    >>> min_dist([0, 4, 2, 1], [True, True, True, True], 4)
+    -1
+    >>> min_dist([float('inf'), float('inf')], [False, False], 2)
+    -1
+    """
+    min_val = float("inf")
+    min_ind = -1
+    for i in range(v):
+        if (not vset[i]) and mdist[i] < min_val:
+            min_ind = i
+            min_val = mdist[i]
+    return min_ind
 
 
 def dijkstra(graph, v, src):
@@ -75,36 +75,36 @@ def dijkstra(graph, v, src):
 	vset = [False for _ in range(v)]
 	mdist[src] = 0.0
 
-	for _ in range(v - 1):
-		u = min_dist(mdist, vset, v)
-		vset[u] = True
+    for _ in range(v - 1):
+        u = min_dist(mdist, vset, v)
+        vset[u] = True
 
-		for i in range(v):
-			if (
-				(not vset[i])
-				and graph[u][i] != float("inf")
-				and mdist[u] + graph[u][i] < mdist[i]
-			):
-				mdist[i] = mdist[u] + graph[u][i]
+        for i in range(v):
+            if (
+                (not vset[i])
+                and graph[u][i] != float("inf")
+                and mdist[u] + graph[u][i] < mdist[i]
+            ):
+                mdist[i] = mdist[u] + graph[u][i]
 
-	print_dist(mdist, v)
+    print_dist(mdist, v)
 
 
 if __name__ == "__main__":
-	V = int(input("Enter number of vertices: ").strip())
-	E = int(input("Enter number of edges: ").strip())
+    V = int(input("Enter number of vertices: ").strip())
+    E = int(input("Enter number of edges: ").strip())
 
-	graph = [[float("inf") for i in range(V)] for j in range(V)]
+    graph = [[float("inf") for i in range(V)] for j in range(V)]
 
-	for i in range(V):
-		graph[i][i] = 0.0
+    for i in range(V):
+        graph[i][i] = 0.0
 
-	for i in range(E):
-		print("\nEdge ", i + 1)
-		src = int(input("Enter source:").strip())
-		dst = int(input("Enter destination:").strip())
-		weight = float(input("Enter weight:").strip())
-		graph[src][dst] = weight
+    for i in range(E):
+        print("\nEdge ", i + 1)
+        src = int(input("Enter source:").strip())
+        dst = int(input("Enter destination:").strip())
+        weight = float(input("Enter weight:").strip())
+        graph[src][dst] = weight
 
-	gsrc = int(input("\nEnter shortest path source:").strip())
-	dijkstra(graph, V, gsrc)
+    gsrc = int(input("\nEnter shortest path source:").strip())
+    dijkstra(graph, V, gsrc)