added swift

Author: Morfly

src/kotlin/sequential/graph/bfs/BUILD

@@ -2,9 +2,7 @@ load("@io_bazel_rules_kotlin//kotlin:kotlin.bzl", "kt_jvm_library")
 
 kt_jvm_library(
     name = "bfs_lib",
-    srcs = glob([
-        "*.kt",
-    ]),
+    srcs = glob(["*.kt"]),
 )
 
 java_binary(

src/swift/Stub.swift renamed to src/swift/BUILD

@@ -0,0 +1,23 @@
+workspace(name = "algorithms_swift")
+
+load("@bazel_tools//tools/build_defs/repo:http.bzl", "http_archive")
+
+http_archive(
+    name = "build_bazel_rules_swift",
+    sha256 = "d2f38c33dc82cf3160c59342203d31a030e53ebe8f4c7365add7a549223f9c62",
+    url = "https://github.com/bazelbuild/rules_swift/releases/download/0.15.0/rules_swift.0.15.0.tar.gz",
+)
+
+load(
+    "@build_bazel_rules_swift//swift:repositories.bzl",
+    "swift_rules_dependencies",
+)
+
+swift_rules_dependencies()
+
+load(
+    "@build_bazel_rules_swift//swift:extras.bzl",
+    "swift_rules_extra_dependencies",
+)
+
+swift_rules_extra_dependencies()

src/swift/WORKSPACE

@@ -0,0 +1,9 @@
+load("@build_bazel_rules_swift//swift:swift.bzl", "swift_binary")
+
+swift_binary(
+    name = "bfs",
+    srcs = [
+        "BreadthFirstTraversal.swift",
+        "main.swift",
+    ],
+)

src/swift/sequential/graph/bfs/BUILD

@@ -0,0 +1,37 @@
+typealias Graph<T: Hashable> = [T: [T]]
+
+
+func bfs<T>(in graph: Graph<T>, withRoot root: T) -> [T] {
+    var explored = Set<T>()
+    var traversed = [T]()
+    var searchQueue = [root]
+    var queuePopIndex = 0
+    
+    while searchQueue.count > queuePopIndex {
+        let node = searchQueue[queuePopIndex]
+        queuePopIndex += 1
+        
+        if !explored.contains(node) {
+            explored.insert(node)
+            traversed.append(node)
+            if let successors = graph[node] {
+                searchQueue += successors
+            }
+        }
+    }
+    return traversed
+}
+
+
+func bfsMain() {
+    let graph = [
+        "you": ["alice", "bob", "clair"],
+        "alice": ["peggy"],
+        "clair": ["thom", "jonny"],
+        "bob": ["anuj", "peggy"]
+    ]
+
+    print(
+        bfs(in: graph, withRoot: "you")
+    )
+}

src/swift/sequential/graph/bfs/BreadthFirstTraversal.swift

@@ -0,0 +1 @@
+bfsMain()

src/swift/sequential/graph/bfs/main.swift

@@ -0,0 +1,17 @@
+load("@build_bazel_rules_swift//swift:swift.bzl", "swift_binary")
+
+swift_binary(
+    name = "dfs_iterative",
+    srcs = [
+        "IterativeBreadthFirstTraversal.swift",
+        "main.swift",
+    ],
+)
+
+swift_binary(
+    name = "dfs_recursive",
+    srcs = [
+        "RecursiveBreadthFirstTraversal.swift",
+        "main.swift",
+    ],
+)

src/swift/sequential/graph/dfs/BUILD

@@ -0,0 +1,35 @@
+typealias Graph<T: Hashable> = [T: [T]]
+
+
+func dfs<T>(in graph: Graph<T>, withRoot root: T) -> [T] {
+    var explored = Set<T>()
+    var traversed = [T]()
+    var searchStack = [root]
+    
+    while !searchStack.isEmpty {
+        let node = searchStack.removeLast()
+        
+        if !explored.contains(node) {
+            explored.insert(node)
+            traversed.append(node)
+            if let successors = graph[node] {
+                searchStack += successors
+            }
+        }
+    }
+    return traversed
+}
+
+
+func dfsMain() {
+    let graph = [
+        "you": ["alice", "bob", "clair"],
+        "alice": ["peggy"],
+        "clair": ["thom", "jonny"],
+        "bob": ["anuj", "peggy"]
+    ]
+
+    print(
+        dfs(in: graph, withRoot: "you")
+    )
+}

src/swift/sequential/graph/dfs/IterativeBreadthFirstTraversal.swift

@@ -0,0 +1,37 @@
+typealias Graph<T: Hashable> = [T: [T]]
+
+
+func dfs<T>(in graph: Graph<T>, withRoot root: T) -> [T] {
+    var explored = Set<T>()
+    var traversed = [T]()
+    
+    func explore(_ node: T) {
+        explored.insert(node)
+        traversed.append(node)
+
+        guard let successors = graph[node] else { return }
+
+        for succ in successors {
+            if !explored.contains(succ) { 
+                explore(succ) 
+            }
+        }
+    }
+    explore(root)
+    
+    return traversed
+}
+
+
+func dfsMain() {
+    let graph = [
+        "you": ["alice", "bob", "clair"],
+        "alice": ["peggy"],
+        "clair": ["thom", "jonny"],
+        "bob": ["anuj", "peggy"]
+    ]
+
+    print(
+        dfs(in:graph, withRoot: "you")
+    )
+}

src/swift/sequential/graph/dfs/README.md

@@ -0,0 +1 @@
+dfsMain()