hackhit
diff --git a/‎Graphs/prim.py‎ ‎graphs/prim.py‎Graphs/prim.py renamed to graphs/prim.py
Lines changed: 0 additions & 3 deletions b/‎Graphs/prim.py‎ ‎graphs/prim.py‎Graphs/prim.py renamed to graphs/prim.py
Lines changed: 0 additions & 3 deletions
@@ -28,7 +28,6 @@ def __init__(self, id):
         """
         Arguments:
             id - input an id to identify the vertex
-
         Attributes:
             neighbors - a list of the vertices it is linked to
             edges     - a dict to store the edges's weight
@@ -59,9 +58,7 @@ def addEdge(self, vertex, weight):
 def prim(graph, root):
     """
     Prim's Algorithm.
-
     Return a list with the edges of a Minimum Spanning Tree
-
     prim(graph, graph[0])
     """
     A = []