C++拓扑排序程序(2)

                                         if(!(--indegree[k]))
                                            Push(&S,k);//入度为0，进栈 
                            }
               }
         if(count<G.vexnum)
               printf(\"Error!\\n\");
         else
               printf(\"\\nSort Success !\");
      }     
    //*********************主函数**********************                     
  int main()
    {
                ALGraph G;
                CreatGraph(&G);
                TopologicalSort(G);
                getch();
                return 0;
    }