mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-03-30 18:36:43 +00:00
Code Issues Packages Projects Releases Wiki Activity

Added doctests

Browse Source
This commit is contained in:
Joelkurien 2024-10-28 14:36:29 +11:00
commit 3d4acaaefb
1 changed files with 6 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
graphs/johnson_graph.py
View File

@ -139,9 +139,11 @@ class JohnsonGraph:
vertex_b, vertex_b,
weight + hash_path[vertex_a] - hash_path[vertex_b], weight + hash_path[vertex_a] - hash_path[vertex_b],
) )
self.edges[i] = (vertex_a, self.edges[i] = (
vertex_b, vertex_a,
weight + hash_path[vertex_a] - hash_path[vertex_b]) vertex_b,
weight + hash_path[vertex_a] - hash_path[vertex_b],
)
self.graph.pop("#") self.graph.pop("#")
filtered_edges = [] filtered_edges = []
@ -154,7 +156,7 @@ class JohnsonGraph:
for vertex1, vertex2, node_weight in self.edges: for vertex1, vertex2, node_weight in self.edges:
if vertex1 == vertex: if vertex1 == vertex:
self.graph[vertex].append((vertex2, node_weight)) self.graph[vertex].append((vertex2, node_weight))
distances = [] distances = []
for vertex1 in self.graph: for vertex1 in self.graph:
new_dist = self.dijkstra(vertex1) new_dist = self.dijkstra(vertex1)