void Topsort(AdjList *G,int *indegree){ int i,j,k; get_in_degree(G,indegree); for(i = 1;i <= G->vexnum;i++){ k = get_zero(G,indegree); if(k != -1){ printf("%d \n",k); set_sub(G,indegree,k); } } }
UINT GRAPH::get_degree(VERTEX const* vex) const { IS_TRUE(m_pool != NULL, ("not yet initialized.")); if (vex == NULL) return 0; return get_in_degree(vex) + get_out_degree(vex); }