Kruskals algorithm add edges sorting mino fix

Author: ivanmmarkovic

graphs/minimum-spanning-tree/kruskals-algorithm/__pycache__/graph.cpython-38.pyc

@@ -40,10 +40,8 @@ def add_edge(self, vertex_1_label: str = None, vertex_2_label: str = None, weigh
         self.edges.append([vertex_2_label, vertex_1_label, weight])
 
     def kruskal(self):
-        print(self.edges)
         # sort edges by weight increasingly
         self.edges = sort_edges_by_weight_increasingly(self.edges)
-        print(self.edges)
         minimum_spanning_tree: list = []
         for edge_list in self.edges:
             vertex_one: Vertex = self.vertices[edge_list[0]]