1
go 图的深度遍历 leetcode797
source link: https://studygolang.com/articles/35288
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
go 图的深度遍历 leetcode797
图的表示有邻接表与邻接矩阵，若没有特殊要求，笔者习惯用邻接表
// 返回值
var res [][]int
func allPathsSourceTarget(rawGraph [][]int) [][]int {
// 每次都要清空
res = res[0:0]
// 生成邻接表
graph := make(map[int][]int)
for i, v := range rawGraph {
graph[i] = append(graph[i], v...)
}
res := allPath(graph)
return res
}
func allPath(graph map[int][]int) [][]int {
var path []int
nums := len(graph) - 1
// 基础参数准备完毕，开始深度遍历
dfs(0, nums, graph, path)
return res
}
func dfs(start, nums int, graph map[int][]int, path []int) {
path = append(path, start)
// dfs需要出口，必须
if start == nums {
// 这部分取决于题目要求 visited(node)
path1 := make([]int, len(path))
copy(path1, path)
res = append(res, path1)
// 状态回滚
path = path[:len(path)-1]
return
}
// dfs 当前结点的所有子节点
for _, newStart := range graph[start] {
dfs(newStart, nums, graph, path)
}
path = path[:len(path)-1]
}
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK