---

1.创建numK，遍历有向图，统计每个顶点的出度和入度，出度大于入度则输出并将numK++。

2.

int printVertices(Mgraph G){
    int numK=0;
    for(int i=0;i<G.numVertics;i++){
        int inDegree=0,outDegree=0;
        for(int j=0;j<G.numVertics;j++){
            if(G.Edge[i][j]==1) outDegree++;
            if(G.Edge[j][i]==1) inDegree++;
            }
        if(outDegree>inDegree){
            printf('&d\n',i);
            numK++;
        }
    }
    return numK;
}