#include "stdafx.h"
#include <cstdio>
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
int main()
{
int n;
int m;
int map[50][50] = { 0 };
int rudu[50] = { 0 };
stack<int>s;
bool vis[50] = { 0 };
int num = 0;
cin >> n >> m;
for (int i = 0; i < m; i++)//输入图
{
int x, y;
cin >> x >> y; cin >> map[x][y];
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)//求i点的入度
{
if (map[j][i] != 0)rudu[i]++;
}
}
for (int i = 0; i < n; i++)
{
if (rudu[i] == 0)
{
s.push(i);
vis[i] = 1;
}
}
while (!s.empty())
{
int t = s.top(); s.pop();
cout << t << endl;
num++;
for (int i = 0; i < n; i++)
{
if (map[t][i] != 0)rudu[i]--;
}
for (int i = 0; i < n; i++)
{
if (rudu[i] == 0 && vis[i] == 0)
{
s.push(i);
vis[i] = 1;
}
}
}
if (num < n)cout << "有回路";
else cout << "没回路";
}
/*
7 10
0 2 1
0 4 1
1 3 1
1 2 1
3 5 1
2 5 1
2 6 1
5 6 1
4 6 1
2 4 1
*/
/*
7 10
0 2 1
0 4 1
1 3 1
1 2 1
3 5 1
2 5 1
2 6 1
5 6 1
4 0 1
2 4 1
*/
TOP排序
猜你喜欢
转载自blog.csdn.net/qq_32259423/article/details/80831176
今日推荐
周排行