Resolved issues regarding ruff testing and merge conflicts

DIRECTORY.md

@@ -503,6 +503,7 @@
   * [Graphs Floyd Warshall](graphs/graphs_floyd_warshall.py)
   * [Greedy Best First](graphs/greedy_best_first.py)
   * [Greedy Min Vertex Cover](graphs/greedy_min_vertex_cover.py)
+  * [Johnson Graph](graphs/johnson_graph.py)
   * [Kahns Algorithm Long](graphs/kahns_algorithm_long.py)
   * [Kahns Algorithm Topo](graphs/kahns_algorithm_topo.py)
   * [Karger](graphs/karger.py)

graphs/johnson_graph.py

@@ -52,7 +52,6 @@ class JohnsonGraph:
     # could not be handled by either the dijkstra
     #or the bellman ford algorithm efficiently
     def johnson_algo(self):
-        
         self.add_vertices("#")
         for v in self.graph:
             if v != "#":
@@ -79,6 +78,7 @@ class JohnsonGraph:
             distances.append(new_dist)
         return distances
 
+
 g = JohnsonGraph()
 # this a complete connected graph
 g.add_vertices("A")