算法：深度优先搜索

算法：深度优先搜索

1.简介

深度优先搜索（Depth First Search）是针对图或二叉对的遍历方法。与广度优先搜索类似，深度优先搜索先遍以树叉的纵深长度为优先遍历，而广度优先搜索以树叉分分叉点数量为优先。

2.图示

以A节点为启始节点，查找F节点流程。

3.演示

package main

import "fmt"

func main() {
	graph := make(map[string][]string)
	graph["A"] = []string{"B", "C"}
	graph["B"] = []string{"D", "E"}
	graph["C"] = []string{"F", "G"}
	graph["D"] = []string{}
	graph["E"] = []string{}
	graph["F"] = []string{}
	graph["G"] = []string{}

	dest, ok := search(graph, "A", "F")
	fmt.Println(dest, ok)
}

func search(graph map[string][]string, start, dest string) (string, bool) {
	// Check start point
	nodes, ok := graph[start]
	if !ok {
		return "", false
	}
	// Check dest point
	if _, ok := graph[dest]; !ok {
		return "", false
	}

	searchQueue := make([]string, 0, len(nodes))
	searchQueue = append(searchQueue, nodes...)
	searched := make(map[string]struct{})

	for len(searchQueue) > 0 {
		current := searchQueue[0]
		searchQueue = searchQueue[1:]

		if _, ok := searched[current]; ok {
			continue
		}

		searched[current] = struct{}{}

		if current == dest {
			return current, true
		}

		searchQueue = append(graph[current], searchQueue...)
	}

	return "", false
}

4.参考

• 基本算法——深度优先搜索（DFS）和广度优先搜索（BFS）