void TotSort()
{
int i, j, k, count = 0;
int S[MaxSize], top = -1;
EdgeNode* p = nullptr;
for (i = 0; i < vertexNum; i++)
{
if (adjlist[i].in == 0) S[++top] = i;
}
while (top != -1)
{
j = S[top--];
cout << adjlist[j].vertex;
count++;
p = adjlist[j].firstEdge;
while (p != nullptr)
{
k = p->adjvex;
adjlist[k].in--;
if (adjlist[k].in == 0) S[++top] = k;
p = p->next;
}
if (count < vertexNum)cout << "有回路";
}
}