grdfs.c

经典c++程序的实现

void DFS(Graph& G, int v) {  // Depth first search
  PreVisit(G, v);           // Take appropriate action
  G.Mark[v] = VISITED;
  for (Edge w = G.first(v); G.isEdge(w); w = G.next(w))
    if (G.Mark[G.v2(w)] == UNVISITED)
      DFS(G, G.v2(w));
  PostVisit(G, v);          // Take appropriate action
}