图的深度优先搜索

#include<bits/stdc++.h>
using namespace std;
const int MAX_N = 100;
const int MAX_M = 10000;
struct edge{
    int v,next;
}e[MAX_N];
int p[MAX_N],eid;
int init(){
memset(p,-1,sizeof(p));
eid = 0;
}
void insert(int u,int v){
    e[eid].v = v;
    e[eid].next  = p[u];
    p[u] = eid++;
}
bool vst[MAX_N];
void dfs(int u){
    cout<<"visiting"<<u<<endl;
    vst[MAX_N] = true;
    for(int i=p[u];i!=-1;i=e[i].next){
        if(!vst[e[i].v]){
            dfs(e[i].v);
        }
    }

}
int main(){
    init();
    int u,v;

}

 

转载于:https://www.cnblogs.com/upstart/p/6807797.html