Added depth first search in kotlin

Author: InLieuOfLuna

searchingAlgo/DepthFirstSearch/depthFirstSearch.kt

@@ -1,3 +1,7 @@
+/**
+ * Creates a Graph with [size] nodes
+ * @param init constructor for adding the edges of the nodes delegated to the instances
+ */
 class Graph(size: Int, init: Graph.() -> Unit) {
     val adjacency: Array<MutableList<Int>> = Array(size) { ArrayList() }
 
@@ -6,6 +10,10 @@ class Graph(size: Int, init: Graph.() -> Unit) {
     fun addEdge(node: Int, to: Int) = adjacency[node].add(to)
 }
 
+/**
+ * Prints the route taken when exploring the [graph] starting from [current]
+ * @param searched an array of booleans relating to whether the relating nodes have been searched
+ */
 fun depthFirstSearch(graph: Graph, current: Int, searched: Array<Boolean> = Array(graph.adjacency.size) { false }) {
     if(!searched[current]) {
         searched[current] = true