深度优先:
void searchDFS(int v,boolean isVisited[]): print("visit: "+v) isVisited[v]=true w=getFirstNeighber(v) while(w!=-1): searchDFS(w,isVisited) w=getNextNeighber(v,w)
广度优先:
void searchBFS(int v,boolean isVisited[]): Q.add(v) while(!isEmpty(Q)): currentV=Q.removeFirst() print("visited :"+currentV) isVisited[currentV]=true w=getFirstNeighber(currentV) while(w!=-1): Q.add(w) w=getNextNeighber(currentV,w)