---

(1) 两次for循环统计所有节点的入度和出度，分别存储到数组indegrees[MAXV]和outDegrees[MAXV]. 最后统计所有出度大于入度的顶点，总数计入nCount;

(2)  

int printVertices(MGraph G){

int inDegrees[MAXV]=0;int OutDegrees[MAXV]=0; int nCount=0;

for (int i ;i<=G.numVertices;i++)

    for( (int j ;j<=G.numVertices;j++))

         if(G.Edge[ i ][ j ] = 1)

         {inDegrees[ j ]++;outDegrees[i]++;}

//所有节点入度出度已经计算完毕

for (int k ;k<=G.numVertices;k++)

    if( outDegrees[k] > inDegrees[k] )

    {printf(k);   nCount++}

//K顶点总数已经计算至nCount;

return nCount;

}

---