algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-19 02:38:12 +08:00
Code Issues Packages Projects Releases Wiki Activity

1. typo fix {playfair_cipher.py, AVL.py}

Browse Source 
2. Corrected Logic {AVL.py, 104-107}
3. Removed unnecessary semicolons {BellmanFord.py, Dijkstra.py}
This commit is contained in:
ashu01
2017-12-31 14:30:31 +05:30
parent a033150426
commit 4fb978cf58
4 changed files with 21 additions and 21 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
data_structures/Graph/BellmanFord.py
View File

@ -7,11 +7,11 @@ def printDist(dist, V):
print(i,"\t",int(dist[i]),end = "\t")
else:
print(i,"\t","INF",end="\t")
print();
print()
def BellmanFord(graph, V, E, src):
mdist=[float('inf') for i in range(V)]
mdist[src] = 0.0;
mdist[src] = 0.0
for i in range(V-1):
for j in range(V):
@ -35,13 +35,13 @@ def BellmanFord(graph, V, E, src):
#MAIN
V = int(input("Enter number of vertices: "));
E = int(input("Enter number of edges: "));
V = int(input("Enter number of vertices: "))
E = int(input("Enter number of edges: "))
graph = [dict() for j in range(E)]
for i in range(V):
graph[i][i] = 0.0;
graph[i][i] = 0.0
for i in range(E):
print("\nEdge ",i+1)