From b911a5578ce342ad410627143c0aa5470e459739 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:43:44 +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 | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/graphs/johnson_graph.py b/graphs/johnson_graph.py
index 68029271a..6b5dbb6ca 100644
--- a/graphs/johnson_graph.py
+++ b/graphs/johnson_graph.py
@@ -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("#")