You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.
// File: graph_dfs.go
// Created Time: 2023-02-18
// Author: Reanon (793584285@qq.com)
package chapter_graph
import (
. "github.com/krahets/hello-algo/pkg"
)
/* 深度优先遍历辅助函数 */
func dfs ( g * graphAdjList , visited map [ Vertex ] struct { } , res * [ ] Vertex , vet Vertex ) {
// append 操作会返回新的的引用，
* res = append ( * res , vet )
visited [ vet ] = struct { } { }
// 遍历该顶点的所有邻接顶点
for _ , adjVet := range g . adjList [ vet ] {
_ , isExist := visited [ adjVet ]
// 递归访问邻接顶点
if ! isExist {
dfs ( g , visited , res , adjVet )
}
}
}
/* 深度优先遍历 */
// 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
func graphDFS ( g * graphAdjList , startVet Vertex ) [ ] Vertex {
// 顶点遍历序列
res := make ( [ ] Vertex , 0 )
// 哈希表，用于记录已被访问过的顶点
visited := make ( map [ Vertex ] struct { } )
dfs ( g , visited , & res , startVet )
// 返回顶点遍历序列
return res
}
