mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-03-27 08:56:44 +00:00
Code Issues Packages Projects Releases Wiki Activity

Handled doctests

Browse Source
This commit is contained in:
Joelkurien 2024-10-28 13:43:18 +11:00
parent 14ddb93c6b
commit 32b9b8f6b4
1 changed files with 6 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
graphs/johnson_graph.py
View File

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