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

Pyupgrade to Python 3.9 (#4718)

Browse Source 
* Pyupgrade to Python 3.9

* updating DIRECTORY.md

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
Christian Clauss
2021-09-07 13:37:03 +02:00
committed by GitHub
parent 5d5831bdd0
commit cecf43d648
142 changed files with 523 additions and 530 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
graphs/bellman_ford.py
View File

@@ -11,7 +11,7 @@ def check_negative_cycle(
graph: list[dict[str, int]], distance: list[float], edge_count: int
):
for j in range(edge_count):
u, v, w = [graph[j][k] for k in ["src", "dst", "weight"]]
u, v, w = (graph[j][k] for k in ["src", "dst", "weight"])
if distance[u] != float("inf") and distance[u] + w < distance[v]:
return True
return False
@@ -38,7 +38,7 @@ def bellman_ford(
for i in range(vertex_count - 1):
for j in range(edge_count):
u, v, w = [graph[j][k] for k in ["src", "dst", "weight"]]
u, v, w = (graph[j][k] for k in ["src", "dst", "weight"])
if distance[u] != float("inf") and distance[u] + w < distance[v]:
distance[v] = distance[u] + w
@@ -62,10 +62,10 @@ if __name__ == "__main__":
for i in range(E):
print("Edge ", i + 1)
src, dest, weight = [
src, dest, weight = (
int(x)
for x in input("Enter source, destination, weight: ").strip().split(" ")
]
)
graph[i] = {"src": src, "dst": dest, "weight": weight}
source = int(input("\nEnter shortest path source:").strip())