Example Topological Sort

Topo.cs

Class GraphDemo {
  void DFS(int u) {
    if (HasCycle)
      return ;
    if (color[u] == GRAY) {
      HasCycle = true;
      return ;
    }
    if (color[u] == BLACK)
      return ;

    color[u] = GRAY;
    foreach (int v in AdjList[u])
      DFS(v);
    color[u] = BLACK;
    linkedList.AddToHead(u);
  }

  void RunTopo() {
    INIT();
    // nV = number of vertices
    for (int i=0; i<nV; i++)
      if (color[i] == WHITE)
        DFS(i);
  }
}