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

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

Author: pre-commit-ci[bot]

graphs/minimum_spanning_tree_prims2.py

@@ -47,7 +47,6 @@ def get_child_right_position(position: int) -> int:
     return (2 * position) + 2
 
 
-
 class MinPriorityQueue(Generic[T]):
     """
     Minimum Priority Queue Class
@@ -128,6 +127,7 @@ def update_key(self, elem: T, weight: int) -> None:
                 self._bubble_down(elem)
         else:
             self._bubble_down(elem)
+
     def _bubble_up(self, elem: T) -> None:
         """Place node at proper position (upward movement) - internal use only"""
         curr_pos = self.position_map[elem]
@@ -146,7 +146,7 @@ def _bubble_down(self, elem: T) -> None:
         _, weight = self.heap[curr_pos]
         child_left_position = get_child_left_position(curr_pos)
         child_right_position = get_child_right_position(curr_pos)
-        
+
         # Check if both children exist
         if child_left_position < self.elements and child_right_position < self.elements:
             _, child_left_weight = self.heap[child_left_position]
@@ -155,15 +155,15 @@ def _bubble_down(self, elem: T) -> None:
                 self._swap_nodes(child_right_position, curr_pos)
                 self._bubble_down(elem)
                 return
-                
+
         # Check left child
         if child_left_position < self.elements:
             _, child_left_weight = self.heap[child_left_position]
             if child_left_weight < weight:
                 self._swap_nodes(child_left_position, curr_pos)
                 self._bubble_down(elem)
                 return
-                
+
         # Check right child
         if child_right_position < self.elements:
             _, child_right_weight = self.heap[child_right_position]
@@ -270,7 +270,7 @@ def prims_algo(
     # Main algorithm loop
     while not priority_queue.is_empty():
         node = priority_queue.extract_min()
-        
+
         # Explore neighbors of current node
         for neighbor, weight in graph.connections[node].items():
             # Update if found better connection to tree