algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-05 17:34:49 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix bug in bellman_ford.py (#1544)

Browse Source
This commit is contained in:
JakobZhao
2019-11-10 17:01:38 +08:00
committed by John Law
parent 4c37eb7d07
commit 82a11d7f31
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
graphs/bellman_ford.py
View File

@ -13,14 +13,14 @@ def BellmanFord(graph, V, E, src):
mdist[src] = 0.0 mdist[src] = 0.0
for i in range(V - 1): for i in range(V - 1):
for j in range(V): for j in range(E):
u = graph[j]["src"] u = graph[j]["src"]
v = graph[j]["dst"] v = graph[j]["dst"]
w = graph[j]["weight"] w = graph[j]["weight"]
if mdist[u] != float("inf") and mdist[u] + w < mdist[v]: if mdist[u] != float("inf") and mdist[u] + w < mdist[v]:
mdist[v] = mdist[u] + w mdist[v] = mdist[u] + w
for j in range(V): for j in range(E):
u = graph[j]["src"] u = graph[j]["src"]
v = graph[j]["dst"] v = graph[j]["dst"]
w = graph[j]["weight"] w = graph[j]["weight"]