Added Borůvka's algorithm, a graph algorithm that finds the minimum spanning tree. Code Changes.

srkchowdary2000 · srkchowdary2000 · commit aba7767abf5a · 2021-08-23T13:18:06.000+05:30
diff --git a/graphs/boruvka.py b/graphs/boruvka.py
@@ -114,13 +114,13 @@ def boruvka(self) -> None:
                     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]
 
