mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-31 14:43:43 +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:18:27 +00:00
parent 9a4e1d333f
commit a00d41c861
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

@ -11,16 +11,16 @@ class JohnsonGraph:
self.graph: dict[str, list] = {} self.graph: dict[str, list] = {}
# add vertices for a graph # add vertices for a graph
def add_vertices(self, u:int) -> None: def add_vertices(self, u: int) -> None:
self.graph[u] = [] self.graph[u] = []
# assign weights for each edges formed of the directed graph # 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:
self.edges.append((u, v, w)) self.edges.append((u, v, w))
self.graph[u].append((v, w)) self.graph[u].append((v, w))
# 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:
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)]
distances[s] = 0 distances[s] = 0
@ -37,7 +37,7 @@ class JohnsonGraph:
return distances return distances
# 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:
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