mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-04 21:06:50 +00:00
Code Issues Packages Projects Releases Wiki Activity

Handled word length

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

6
graphs/johnson_graph.py
View File

@ -117,13 +117,11 @@ class JohnsonGraph:
>>> g = JohnsonGraph() >>> g = JohnsonGraph()
>>> g.add_vertices("A") >>> g.add_vertices("A")
>>> g.add_vertices("B") >>> g.add_vertices("B")
>>> g.add_vertices("C")
>>> g.add_edge("A", "B", 1) >>> g.add_edge("A", "B", 1)
>>> g.add_edge("B", "C", 2) >>> g.add_edge("B", "A", 2)
>>> g.add_edge("A", "C", 4)
>>> optimal_paths = g.johnson_algo() >>> optimal_paths = g.johnson_algo()
>>> optimal_paths >>> optimal_paths
[{'A': 0, 'B': 1, 'C': 3}, {'A': None, 'B': 0, 'C': 2}, {'A': None, 'B': None, 'C': 0}] [{'A': 0, 'B': 1}, {'A': 2, 'B': 0}]
""" """
self.add_vertices("#") self.add_vertices("#")
for vertex in self.graph: for vertex in self.graph: