BFS实现:
public void BFS(Graph G){
for (int i = 0; i < G.size; i++){
visited[i] = false;
}
for (int j = 0; j < G.size; j++){
if (!visited[j]){
BFSOrder(G,j);
}
}
}
public void BFSOrder(Graph G,int i){
visited[i] = true;
EnQueue(Q,i);
while(!Q.isEmpty()){
int v = DeQueue(Q);
for (int w = FirstNeighbor(G,v); w >0; w = NextNeighbor(G,v,w)){
if (!visited[v]){
visited[v] = true;
EnQueue(Q,v);
}
}
}
}
DFS实现
public void DFS(Graph G){
for (int i= 0; i < G.size ;i++){
visited[i] = false;
}
for (int j = 0;j<G.size ; j++){
if (!visited[j]){
DFSOrder(G,j);
}
}
}
public void DFSOrder(Graph G, int j){
visited[j] = true;
for (int w = FirstNeighbor(G,j); w > 0; w = NextNeighbor(G,j,w)){
if (!visited[w]){
DFSOrder(G,w);
}
}
}