added grid bfs, groovy draft

Author: Morfly

src/groovy/.bazelrc

@@ -0,0 +1,2 @@
+build --java_toolchain=@bazel_tools//tools/jdk:toolchain_java11 
+build --host_java_toolchain=@bazel_tools//tools/jdk:toolchain_java11

src/groovy/BUILD

@@ -0,0 +1,11 @@
+workspace(name = "algorithms_groovy")
+
+load("@bazel_tools//tools/build_defs/repo:http.bzl", "http_archive")
+http_archive(
+    name = "io_bazel_rules_groovy",
+    url = "https://github.com/bazelbuild/rules_groovy/archive/0.0.6.tar.gz",
+    sha256 = "21c7172786623f280402d3b3a2fc92f36568afad5a4f6f5ea38fd1c6897aecf8",
+    strip_prefix = "rules_groovy-0.0.6",
+)
+load("@io_bazel_rules_groovy//groovy:repositories.bzl", "rules_groovy_dependencies")
+rules_groovy_dependencies()

src/groovy/WORKSPACE

@@ -0,0 +1,7 @@
+load("@io_bazel_rules_groovy//groovy:groovy.bzl", "groovy_binary")
+
+groovy_binary(
+    name = "bfs",
+    srcs = glob(["*.groovy"]),
+    main_class = "sequential.graph.bfs.BreadthFirstTraversal",
+)

src/groovy/sequential/graph/bfs/BUILD

@@ -0,0 +1,7 @@
+package sequential.graph.bfs
+
+// def hello() {
+//     println "Hello World"
+// }
+
+// hello()

src/groovy/sequential/graph/bfs/BreadthFirstTraversal.groovy

@@ -74,6 +74,6 @@ fun main() {
     )
 
     println(
-        graph.bfs(0, 0)
+        graph.bfs(rootRow = 0, rootCol = 0)
     )
 }

src/kotlin/sequential/graph/bfs/GridBreadthFirstTraversal.kt

@@ -6,4 +6,12 @@ swift_binary(
         "BreadthFirstTraversal.swift",
         "main.swift",
     ],
+)
+
+swift_binary(
+    name = "bfs_grid",
+    srcs = [
+        "GridBreadthFirstTraversal.swift",
+        "main.swift",
+    ],
 )

src/swift/sequential/graph/bfs/BUILD

@@ -0,0 +1,68 @@
+typealias Graph<T> = [[T]]
+
+
+let directions = [(0, -1), (-1, 0), (0, 1), (1, 0)]
+
+
+func bfs<T>(in graph: Graph<T?>, withRoot root: (row: Int, col: Int)) -> [T]? {
+    guard isValid(graph, startingAt: root) else { return nil }
+    
+    let rows = graph.count
+    let cols = graph[0].count
+    let rowBounds = 0..<rows
+    let colBounds = 0..<cols
+    
+    var explored = Array(repeating: Array(repeating: false, count: cols), count: rows)
+    var traversed = [T]()
+    var searchQueue = [root]
+    var queuePopIndex = 0
+    
+    while queuePopIndex < searchQueue.count {
+        let (row, col) = searchQueue[queuePopIndex]
+        queuePopIndex += 1
+        
+        if !explored[row][col], let value = graph[row][col] {
+            explored[row][col] = true
+            traversed.append(value)
+            
+            for (stepRow, stepCol) in directions {
+                let nextRow = row + stepRow
+                let nextCol = col + stepCol
+                
+                if rowBounds ~= nextRow && colBounds ~= nextCol  {
+                    searchQueue.append((nextRow, nextCol))
+                }
+            }
+        }
+    }
+    
+    return traversed
+}
+
+func isValid<T>(_ graph: Graph<T?>, startingAt root: (row: Int, col: Int)) -> Bool {
+    if graph.isEmpty || graph[0].isEmpty { return false }
+    
+    let rows = graph.count
+    let cols = graph[0].count
+    
+    if !(0..<rows).contains(root.row) || !(0..<cols).contains(root.col) { return false }
+    
+    for row in graph {
+        if row.count != cols { return false }
+    }
+    return true
+}
+
+
+func mainBfs() {
+    let graph = [
+        [1, 5, 6],
+        [9, 2, 4],
+        [9, 7, nil],
+    ]
+    
+    
+    print(
+        bfs(in: graph, withRoot: (0, 0)) ?? "Invalid graph"
+    )
+}