mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-30 16:31:08 +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:43:44 +00:00
parent 32b9b8f6b4
commit b911a5578c
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
graphs/johnson_graph.py
View File

@ -31,7 +31,7 @@ class JohnsonGraph:
# perform a dijkstra algorithm on a directed graph
def dijkstra(self, s: str) -> dict:
"""
Computes the shortest path from vertex `s`
Computes the shortest path from vertex `s`
to all other vertices using Dijkstra's algorithm.
"""
distances = {vertex: sys.maxsize - 1 for vertex in self.graph}
@ -52,7 +52,7 @@ class JohnsonGraph:
# carry out the bellman ford algorithm for a node and estimate its distance vector
def bellman_ford(self, s: str) -> dict:
"""
Computes the shortest path from vertex `s`
Computes the shortest path from vertex `s`
to all other vertices using the Bellman-Ford algorithm.
"""
distances = {vertex: sys.maxsize - 1 for vertex in self.graph}
@ -70,7 +70,7 @@ class JohnsonGraph:
# or the bellman ford algorithm efficiently
def johnson_algo(self) -> list[dict]:
"""
Computes the shortest paths between
Computes the shortest paths between
all pairs of vertices using Johnson's algorithm.
"""
self.add_vertices("#")