Added Borůvka's algorithm, a graph algorithm that finds the minimum spanning tree. Solved Test Cases Errors.

Author: srkchowdary2000

graphs/boruvka.py

@@ -112,14 +112,14 @@ def boruvka(self) -> None:
                      of the edge we're observing to it"""
 
                     if (
-                         minimum_weight_edge[u_component] == -1
-                         or minimum_weight_edge[u_component][2] > w
-                     ):
+                        minimum_weight_edge[u_component] == -1
+                        or minimum_weight_edge[u_component][2] > w
+                    ):
                         minimum_weight_edge[u_component] = [u, v, w]
                     if (
-                         minimum_weight_edge[v_component] == -1
-                         or minimum_weight_edge[v_component][2] > w
-                     ):
+                        minimum_weight_edge[v_component] == -1
+                        or minimum_weight_edge[v_component][2] > w
+                    ):
                         minimum_weight_edge[v_component] = [u, v, w]
 
             for node in range(self.m_v):