Fixed Indents

Author: shabirjan

Diff for: Minimum Spanning Tree/Kruskal.swift

@@ -10,12 +10,12 @@ func minimumSpanningTreeKruskal<T>(graph: Graph<T>) -> (cost: Int, tree: Graph<T
   var cost: Int = 0
   var tree = Graph<T>()
   let sortedEdgeListByWeight = graph.edgeList.sorted(by: { $0.weight < $1.weight })
-
+  
   var unionFind = UnionFind<T>()
   for vertex in graph.vertices {
     unionFind.addSetWith(vertex)
   }
-
+  
   for edge in sortedEdgeListByWeight {
     let v1 = edge.vertex1
     let v2 = edge.vertex2
@@ -25,6 +25,6 @@ func minimumSpanningTreeKruskal<T>(graph: Graph<T>) -> (cost: Int, tree: Graph<T
       unionFind.unionSetsContaining(v1, and: v2)
     }
   }
-
+  
   return (cost: cost, tree: tree)
 }

Diff for: Minimum Spanning Tree/Prim.swift

@@ -9,28 +9,28 @@
 func minimumSpanningTreePrim<T>(graph: Graph<T>) -> (cost: Int, tree: Graph<T>) {
   var cost: Int = 0
   var tree = Graph<T>()
-
+  
   guard let start = graph.vertices.first else {
     return (cost: cost, tree: tree)
   }
-
+  
   var visited = Set<T>()
   var priorityQueue = PriorityQueue<(vertex: T, weight: Int, parent: T?)>(
     sort: { $0.weight < $1.weight })
-
+  
   priorityQueue.enqueue((vertex: start, weight: 0, parent: nil))
   while let head = priorityQueue.dequeue() {
     let vertex = head.vertex
     if visited.contains(vertex) {
       continue
     }
     visited.insert(vertex)
-
+    
     cost += head.weight
     if let prev = head.parent {
       tree.addEdge(vertex1: prev, vertex2: vertex, weight: head.weight)
     }
-
+    
     if let neighbours = graph.adjList[vertex] {
       for neighbour in neighbours {
         let nextVertex = neighbour.vertex
@@ -40,6 +40,6 @@ func minimumSpanningTreePrim<T>(graph: Graph<T>) -> (cost: Int, tree: Graph<T>)
       }
     }
   }
-
+  
   return (cost: cost, tree: tree)
 }