Apply suggestions from code review

czgdp1807 · web-flow · commit 97630aded247 · 2025-03-10T10:36:12.000+05:30
diff --git a/pydatastructs/graphs/algorithms.py b/pydatastructs/graphs/algorithms.py
@@ -945,7 +945,7 @@ def _johnson_adjacency_list(graph: Graph):
             else:
                 all_distances[u][v] = float('inf')
 
-    return (all_distances,all_next_vertex)
+    return (all_distances, all_next_vertex)
 
 def topological_sort(graph: Graph, algorithm: str,
                      **kwargs) -> list:
