[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

divide_and_conquer/quicksort.py

@@ -19,6 +19,7 @@ def partition(arr, low, high):
     # Return the partition point
     return i + 1
 
+
 # Function to implement Quick Sort
 def quick_sort(arr, low, high):
     if low < high:
@@ -29,6 +30,7 @@ def quick_sort(arr, low, high):
         quick_sort(arr, low, pi - 1)  # Before partition
         quick_sort(arr, pi + 1, high)  # After partition
 
+
 # Driver code to take user-defined input and sort
 if __name__ == "__main__":
     # Ask the user for input

graphs/kruskal.py

@@ -2,7 +2,7 @@
 class Graph:
     def __init__(self, vertices):
         self.V = vertices  # Number of vertices
-        self.graph = []    # List to store graph edges (u, v, w)
+        self.graph = []  # List to store graph edges (u, v, w)
 
     # Function to add an edge to the graph (u -> v with weight w)
     def add_edge(self, u, v, w):
@@ -73,10 +73,13 @@ def kruskal_mst(self):
         for u, v, w in result:
             print(f"{u} -- {v} == {w}")
 
+
 # Example usage
 if __name__ == "__main__":
-    V = int(input("Enter the number of vertices: "))  # Ask user for the number of vertices
-    E = int(input("Enter the number of edges: "))     # Ask user for the number of edges
+    V = int(
+        input("Enter the number of vertices: ")
+    )  # Ask user for the number of vertices
+    E = int(input("Enter the number of edges: "))  # Ask user for the number of edges
 
     g = Graph(V)  # Create a graph with V vertices