ACM

DFS：
应该用recursion：
dfs(v){
v.visited=TRUE
or(all e vertex connected with V){
if(e.visited=false)
dfs(v);
}
}

BFS: use queue
`
bfs(v){
v.visted=true;
Q.enqueue(v);
while(Q.empty()==false)
for(vertex e connected with v){
if(e.visited==false){
q.push(e)
e.visited=true;
}
}

}

`