---

1、遍历邻接矩阵，计算每个节点的出度和入度，若出度大于入度，则Ksum++。

2、

int printVertices(MGraph G){

int n = G.numVertices;

int i,j,k;

int Ksum = 0;

int inD,outD;

for(i = 0; i<n; i++){

inD =0; outD = 0;

for(k=0; k<n; k++){

if(G.Vertices[i][k]){

outD++;

}

}

for(j=0; j<n; j++){

if(G.Vertices[j][i]){

inD++;

}

}

if(outD > inD){

Output(G.Verticesdata[i]);

Ksum++;

}

}

return Ksum;

}