mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-27 15:01:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Handled type annotation and doctests

Browse Source
This commit is contained in:
Joelkurien 2024-10-28 13:41:22 +11:00
commit 14ddb93c6b
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
graphs/johnson_graph.py
View File

@ -14,14 +14,14 @@ class JohnsonGraph:
self.graph: dict[str, list[tuple[str, int]]] = {}
# add vertices for a graph
def add_vertices(self, u:int) -> None:
def add_vertices(self, u: int) -> None:
"""
Adds a vertex `u` to the graph with an empty adjacency list.
"""
self.graph[u] = []
# assign weights for each edges formed of the directed graph
def add_edge(self, u:str, v:str, w:int) -> None:
def add_edge(self, u: str, v: str, w: int) -> None:
"""
Adds a directed edge from vertex `u` to vertex `v` with weight `w`.
"""
@ -29,7 +29,7 @@ class JohnsonGraph:
self.graph[u].append((v, w))
# 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.
"""
@ -49,7 +49,7 @@ class JohnsonGraph:
return distances
# 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.
"""