From a00d41c861082db1a4effe6b855f0911963627f2 Mon Sep 17 00:00:00 2001 From: "pre-commit-ci[bot]" <66853113+pre-commit-ci[bot]@users.noreply.github.com> Date: Mon, 28 Oct 2024 02:18:27 +0000 Subject: [PATCH] [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --- graphs/johnson_graph.py | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/graphs/johnson_graph.py b/graphs/johnson_graph.py index 6328cd3f4..45a4979a7 100644 --- a/graphs/johnson_graph.py +++ b/graphs/johnson_graph.py @@ -11,16 +11,16 @@ class JohnsonGraph: self.graph: dict[str, list] = {} # add vertices for a graph - def add_vertices(self, u:int) -> None: + def add_vertices(self, u: int) -> None: 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: self.edges.append((u, v, w)) 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: distances = {vertex: sys.maxsize - 1 for vertex in self.graph} pq = [(0, s)] distances[s] = 0 @@ -37,7 +37,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: distances = {vertex: sys.maxsize - 1 for vertex in self.graph} distances[s] = 0