mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-26 10:58:40 +00:00
Code Issues Packages Projects Releases Wiki Activity

[pre-commit.ci] auto fixes from pre-commit.com hooks

Browse Source 
for more information, see https://pre-commit.ci
This commit is contained in:
pre-commit-ci[bot] 2024-10-28 03:36:54 +00:00
parent 3d4acaaefb
commit 2fb5becc4d
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
graphs/johnson_graph.py
View File

@ -161,10 +161,10 @@ class JohnsonGraph:
for vertex1 in self.graph: for vertex1 in self.graph:
new_dist = self.dijkstra(vertex1) new_dist = self.dijkstra(vertex1)
for vertex2 in self.graph: for vertex2 in self.graph:
if new_dist[vertex2] < sys.maxsize-1: if new_dist[vertex2] < sys.maxsize - 1:
new_dist[vertex2] += hash_path[vertex2] - hash_path[vertex1] new_dist[vertex2] += hash_path[vertex2] - hash_path[vertex1]
for key in new_dist: for key in new_dist:
if new_dist[key] == sys.maxsize-1: if new_dist[key] == sys.maxsize - 1:
new_dist[key] = None new_dist[key] = None
distances.append(new_dist) distances.append(new_dist)
return distances return distances