TheAlgorithms/Python
1
0
Fork 0
Code Issues Pull Requests Actions 2 Packages Projects Releases Wiki Activity

all valid python 3

Browse Source
This commit is contained in:
Alex Brown
2018-10-20 14:45:08 -05:00
parent b566055e4b
commit ea2ddaaf6a
37 changed files with 76 additions and 1436 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
data_structures/graph/bellman_ford.py
View File

@@ -35,8 +35,8 @@ def BellmanFord(graph, V, E, src):
#MAIN
V = int(raw_input("Enter number of vertices: "))
E = int(raw_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)]
@@ -45,10 +45,10 @@ for i in range(V):
for i in range(E):
print("\nEdge ",i+1)
src = int(raw_input("Enter source:"))
dst = int(raw_input("Enter destination:"))
weight = float(raw_input("Enter weight:"))
src = int(input("Enter source:"))
dst = int(input("Enter destination:"))
weight = float(input("Enter weight:"))
graph[i] = {"src": src,"dst": dst, "weight": weight}
gsrc = int(raw_input("\nEnter shortest path source:"))
gsrc = int(input("\nEnter shortest path source:"))
BellmanFord(graph, V, E, gsrc)