implemented dfs, bfs

Author: n9te9

searches/breadth_first_search.go

@@ -0,0 +1,76 @@
+package main
+
+import "fmt"
+
+// getIdx return target node index
+func getIdx(target int, nodes []int) int {
+	for i := 0; i < len(nodes); i++ {
+		if nodes[i] == target {
+			return i
+		}
+	}
+	return -1
+}
+
+func notExist(target int, slice []int) bool {
+	for i := 0; i < len(slice); i++ {
+		if slice[i] == target {
+			return false
+		}
+	}
+	return true
+}
+
+// bfs return whether start reach end or not.
+func bfs(start, end int, nodes []int, edges [][]bool) bool {
+	var route []int
+	var queue []int
+	startIdx := getIdx(start, nodes)
+	queue = append(queue, startIdx)
+	for len(queue) > 0 {
+		now := queue[0]
+		route = append(route, nodes[now])
+		// update queue
+		if len(queue) > 1 {
+			queue = queue[1:]
+		} else {
+			queue = queue[0:]
+		}
+		for i := 0; i < len(edges[now]); i++ {
+			if edges[now][i] && notExist(i, queue) {
+				queue = append(queue, i)
+			}
+			edges[now][i] = false
+			edges[i][now] = false
+		}
+		if route[len(route)-1] == end {
+			return true
+		}
+	}
+	return false
+}
+
+func main() {
+	// show graph as node 1-demensional matrix, edge 2-demensional matrix
+	nodes := []int{
+		1, 2, 3, 4, 5, 6,
+	}
+	/*
+		sample graph
+		①-②
+		|  |
+		③-④-⑤-⑥
+	*/
+	edges := [][]bool{
+		{false, true, true, false, false, false},
+		{true, false, false, true, false, false},
+		{true, false, false, true, false, false},
+		{false, true, true, false, true, false},
+		{false, false, false, true, false, true},
+		{false, false, false, false, true, false},
+	}
+	start := 1
+	end := 6
+	result := bfs(start, end, nodes, edges)
+	fmt.Println(result)
+}

searches/depth_first_search.go

@@ -0,0 +1,77 @@
+package main
+
+import "fmt"
+
+// getIdx return target node index
+func getIdx(target int, nodes []int) int {
+	for i := 0; i < len(nodes); i++ {
+		if nodes[i] == target {
+			return i
+		}
+	}
+	return -1
+}
+
+func notExist(target int, slice []int) bool {
+	for i := 0; i < len(slice); i++ {
+		if slice[i] == target {
+			return false
+		}
+	}
+	return true
+}
+
+// dfs return route, whether reach end or not
+func dfs(start, end int, nodes []int, edges [][]bool) ([]int, bool) {
+	var route []int
+	var stack []int
+	startIdx := getIdx(start, nodes)
+	stack = append(stack, startIdx)
+	for len(stack) > 0 {
+		now := stack[len(stack)-1]
+		route = append(route, nodes[now])
+		// update stack
+		if len(stack) > 1 {
+			stack = stack[:len(stack)-1]
+		} else {
+			stack = stack[:len(stack)-1]
+		}
+		for i := 0; i < len(edges[now]); i++ {
+			// exist edge
+			if edges[now][i] && notExist(i, stack) {
+				stack = append(stack, i)
+			}
+			edges[now][i] = false
+			edges[i][now] = false
+		}
+		if route[len(route)-1] == end {
+			return route, true
+		}
+	}
+	return nil, false
+}
+
+func main() {
+	// show graph as node 1-demensional matrix, edge 2-demensional matrix
+	nodes := []int{
+		1, 2, 3, 4, 5, 6,
+	}
+	/*
+		sample graph
+		①-②
+		|  |
+		③-④-⑤-⑥
+	*/
+	edges := [][]bool{
+		{false, true, true, false, false, false},
+		{true, false, false, true, false, false},
+		{true, false, false, true, false, false},
+		{false, true, true, false, true, false},
+		{false, false, false, true, false, true},
+		{false, false, false, false, true, false},
+	}
+	start := 1
+	end := 6
+	route, _ := dfs(start, end, nodes, edges)
+	fmt.Println(route)
+}