Updating to Swift3

I upgraded to swift 3 because it did not run as a grammar problem.

Author: gonini

Shortest Path (Unweighted)/ShortestPath.playground/Pages/Shortest path example.xcplaygroundpage/Contents.swift

@@ -2,15 +2,15 @@ func breadthFirstSearchShortestPath(graph: Graph, source: Node) -> Graph {
   let shortestPathGraph = graph.duplicate()
 
   var queue = Queue<Node>()
-  let sourceInShortestPathsGraph = shortestPathGraph.findNodeWithLabel(source.label)
-  queue.enqueue(sourceInShortestPathsGraph)
+  let sourceInShortestPathsGraph = shortestPathGraph.findNodeWithLabel(label: source.label)
+  queue.enqueue(element: sourceInShortestPathsGraph)
   sourceInShortestPathsGraph.distance = 0
 
   while let current = queue.dequeue() {
     for edge in current.neighbors {
       let neighborNode = edge.neighbor
       if !neighborNode.hasDistance {
-        queue.enqueue(neighborNode)
+        queue.enqueue(element: neighborNode)
         neighborNode.distance = current.distance! + 1
       }
     }
@@ -23,14 +23,14 @@ func breadthFirstSearchShortestPath(graph: Graph, source: Node) -> Graph {
 
 let graph = Graph()
 
-let nodeA = graph.addNode("a")
-let nodeB = graph.addNode("b")
-let nodeC = graph.addNode("c")
-let nodeD = graph.addNode("d")
-let nodeE = graph.addNode("e")
-let nodeF = graph.addNode("f")
-let nodeG = graph.addNode("g")
-let nodeH = graph.addNode("h")
+let nodeA = graph.addNode(label: "a")
+let nodeB = graph.addNode(label: "b")
+let nodeC = graph.addNode(label: "c")
+let nodeD = graph.addNode(label: "d")
+let nodeE = graph.addNode(label: "e")
+let nodeF = graph.addNode(label: "f")
+let nodeG = graph.addNode(label: "g")
+let nodeH = graph.addNode(label: "h")
 
 graph.addEdge(nodeA, neighbor: nodeB)
 graph.addEdge(nodeA, neighbor: nodeC)
@@ -40,5 +40,5 @@ graph.addEdge(nodeC, neighbor: nodeF)
 graph.addEdge(nodeC, neighbor: nodeG)
 graph.addEdge(nodeE, neighbor: nodeH)
 
-let shortestPathGraph = breadthFirstSearchShortestPath(graph, source: nodeA)
+let shortestPathGraph = breadthFirstSearchShortestPath(graph: graph, source: nodeA)
 print(shortestPathGraph.nodes)

Shortest Path (Unweighted)/ShortestPath.playground/Pages/Shortest path example.xcplaygroundpage/timeline.xctimeline

@@ -11,7 +11,7 @@ public class Graph: CustomStringConvertible, Equatable {
     return node
   }
 
-  public func addEdge(source: Node, neighbor: Node) {
+  public func addEdge(_ source: Node, neighbor: Node) {
     let edge = Edge(neighbor: neighbor)
     source.neighbors.append(edge)
   }
@@ -35,13 +35,13 @@ public class Graph: CustomStringConvertible, Equatable {
     let duplicated = Graph()
 
     for node in nodes {
-      duplicated.addNode(node.label)
+      duplicated.addNode(label: node.label)
     }
 
     for node in nodes {
       for edge in node.neighbors {
-        let source = duplicated.findNodeWithLabel(node.label)
-        let neighbour = duplicated.findNodeWithLabel(edge.neighbor.label)
+        let source = duplicated.findNodeWithLabel(label: node.label)
+        let neighbour = duplicated.findNodeWithLabel(label: edge.neighbor.label)
         duplicated.addEdge(source, neighbor: neighbour)
       }
     }

Shortest Path (Unweighted)/ShortestPath.playground/Sources/Graph.swift

@@ -23,7 +23,7 @@ public class Node: CustomStringConvertible, Equatable {
   }
 
   public func remove(edge: Edge) {
-    neighbors.removeAtIndex(neighbors.indexOf { $0 === edge }!)
+    neighbors.remove(at: neighbors.index { $0 === edge }!)
   }
 }
 

Shortest Path (Unweighted)/ShortestPath.playground/Sources/Node.swift

@@ -10,7 +10,7 @@ func breadthFirstSearchShortestPath(graph: Graph, source: Node) -> Graph {
     for edge in current.neighbors {
       let neighborNode = edge.neighbor
       if !neighborNode.hasDistance {
-        queue.enqueue(neighborNode)
+        queue.enqueue(element: neighborNode)
         neighborNode.distance = current.distance! + 1
       }
     }