#define _CRT_SECURE_NO_WARNINGS 1
#include<algorithm>
#include<cstring>
#include<iostream>
using namespace std;
const int N = 100010;
int e[N], idx, ne[N], h[N];
int q[N], d[N];
int n, m;
void add(int a, int b)
{
e[idx] = b, ne[idx] = h[a], h[a] = idx++;//bfs模板
}
bool topsort()
{
int hh = 0,tt = 0;
for (int i = 1; i <= n; i++)
{
if (!d[i]) q[++tt] = i;//找到一个入度为0的节点
}
while (hh <= tt)
{
int t = q[hh++];
for (int i = h[t]; i != -1; i = ne[i])
{
int j = e[i];//搜索到j j的入度减少1
d[j]--;
if (d[j] == 0) q[++tt] = j;//入度为零 直接入队
}
}
return tt == n;//判断拓扑排序是否成功
}
int main()
{
cin >> n >> m;
memset(h, -1, sizeof h);
for (int i = 0; i < m; i++)
{
int a, b;
cin >> a >> b;
add(a, b);
d[b]++;//每add一条指向b的边,b的入度加一
}
if (topsort())
{
for (int i = 1; i <= n; i++) cout << q[i] << ' ';
cout << endl;
}
else cout << "-1" << endl;
return 0;
}
acwing848有向图的拓扑排序
最新推荐文章于 2024-09-17 06:11:32 发布