void DFS(GRAPH G, int v){
visited[v] = true;
visit(v);
for (w = firstAdjVex(G, v); w != 0; w = nextAdjVex(G, v, w)){
if (!visited[w]){
DFS(G, w);
}
}
}
//递归过深可能造成栈溢出
深度优先搜索
最新推荐文章于 2022-05-31 08:28:33 发布
void DFS(GRAPH G, int v){
visited[v] = true;
visit(v);
for (w = firstAdjVex(G, v); w != 0; w = nextAdjVex(G, v, w)){
if (!visited[w]){
DFS(G, w);
}
}
}
//递归过深可能造成栈溢出