图论(持续更新)
图论
图的遍历
DFS
void DFS(Graph G,int v)
{
visited[v] = True;
VisitFunc();//operate to vertex that you want visite
for(w = FirstAdjVex(G,V); w >= 0; w = NextAdjVex(G,v,w))// search for the vertex that are adjacent to v
{
if(!visited[w]) DFS(G,W);// if
原创
2022-04-26 10:46:48 ·
243 阅读 ·
0 评论