mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-31 06:33:44 +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 02:57:01 +00:00
parent debba8c7dd
commit 65f0d0c804
1 changed files with 19 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

23
graphs/johnson_graph.py
View File

@ -60,7 +60,10 @@ class JohnsonGraph:
for vertex_a in self.graph:
for vertex_a, vertex_b, weight in self.edges:
if distances[vertex_a] != sys.maxsize - 1 and distances[vertex_a] + weight < distances[vertex_b]:
if (
distances[vertex_a] != sys.maxsize - 1
and distances[vertex_a] + weight < distances[vertex_b]
):
distances[vertex_b] = distances[vertex_a] + weight
return distances
@ -82,13 +85,25 @@ class JohnsonGraph:
for i in range(len(self.edges)):
vertex_a, vertex_b, weight = self.edges[i]
self.edges[i] = (vertex_a, vertex_b, weight + hash_path[vertex_a] - hash_path[vertex_b])
self.edges[i] = (
vertex_a,
vertex_b,
weight + hash_path[vertex_a] - hash_path[vertex_b],
)
self.graph.pop("#")
self.edges = [(vertex1, vertex2, node_weight) for vertex1, vertex2, node_weight in self.edges if vertex1 != "#"]
self.edges = [
(vertex1, vertex2, node_weight)
for vertex1, vertex2, node_weight in self.edges
if vertex1 != "#"
]
for vertex in self.graph:
self.graph[vertex] = [(vertex2, node_weight) for vertex1, vertex2, node_weight in self.edges if vertex1 == vertex]
self.graph[vertex] = [
(vertex2, node_weight)
for vertex1, vertex2, node_weight in self.edges
if vertex1 == vertex
]
distances = []
for vertex1 in self.graph: