Merge pull request kodecocodes#366 from JaapWijnen/master

Set Cover migrated to swift 3

Author: vincentngo

Set Cover (Unweighted)/README.markdown

@@ -30,4 +30,5 @@ If there is no cover within the group of sets, `cover` returns `nil`.
 
 [Set cover problem on Wikipedia](https://en.wikipedia.org/wiki/Set_cover_problem)
 
-*Written for Swift Algorithm Club by [Michael C. Rael](https://github.com/mrael2)*
+*Written for Swift Algorithm Club by [Michael C. Rael](https://github.com/mrael2)*
+*Migrated to Swift 3 by Jaap Wijnen*

Set Cover (Unweighted)/SetCover.playground/Sources/RandomArrayOfSets.swift

@@ -18,7 +18,7 @@ public func randomArrayOfSets<T>(covering universe: Set<T>,
 
     while true {
       let randomUniverseIndex = Int(arc4random_uniform(UInt32(universe.count)))
-      for (setIndex, value) in universe.enumerate() {
+      for (setIndex, value) in universe.enumerated() {
         if setIndex == randomUniverseIndex {
           generatedSet.insert(value)
           break

Set Cover (Unweighted)/SetCover.playground/Sources/SetCover.swift

@@ -8,7 +8,7 @@ public extension Set {
       var largestSet: Set<Element>?
 
       for set in array {
-        let intersectionLength = remainingSet.intersect(set).count
+        let intersectionLength = remainingSet.intersection(set).count
         if intersectionLength > largestIntersectionLength {
           largestIntersectionLength = intersectionLength
           largestSet = set
@@ -21,7 +21,7 @@ public extension Set {
     while !remainingSet.isEmpty {
       guard let largestSet = largestIntersectingSet() else { break }
       result!.append(largestSet)
-      remainingSet = remainingSet.subtract(largestSet)
+      remainingSet = remainingSet.subtracting(largestSet)
     }
 
     if !remainingSet.isEmpty || isEmpty {