DFS

structnode...{
intid;
intw;
node*next;
};

structarr_node...{
intid;
node*head;
};

arr_nodea[N];
intcolor[N],d[N],f[N],from[N],time;

voidInit()...{
inti;
for(i=0;i<n;i++)...{
color[i]=0;//0:white1:gray2:black
from[i]=-1;
}
}

voidDFS()...{
Init();
inti;
time=0;
for(i=0;i<n;i++)...{
if(color[i]==0)DFS_visit(intid);
}
}

voidDFS_visit(intid)...{
color[id]=1;
d[id]=++time;
node*p=arr_node[id].head;
while(NULL!=p)...{
if(0==color[p->id])...{
DFS_visit(p->id);
from[p->id]=id;
}
p=p->next;
}
color[id]=2;
f[id]=++time;
}
//cost16'