输出拓扑排序所有序列的c代码

#include<iostream>
using namespace std;
void taop(short*adress,short num,short*de,short**k,short n);
int main()
{
short m, n;
short i, j,x,y;
cout << "请输入节点个数" << endl;
cin >> n ;
cout << "请输入边的个数" << endl;
cin >> m;
cout << "请分别输入路径的起点和终点" << endl;
short** k;
short* de;
de = (short*)calloc(sizeof(short), n + 1);
k = (short**)calloc(sizeof(short*), n + 1);
short* adress = (short*)calloc(sizeof(short*), n + 1);
for (i = 1;i < n + 1;i++)
{
k[i] = (short*)calloc(sizeof(short), n + 1);
}

for (i = 1;i < m + 1;i++)
{
cin >> x >> y;
k[x][y] = 1;
de[y]++;
}

taop(adress, 1, de, k, n);