判断某图是否是无向图(图中是否存在环)时,即求拓扑排序。
一个图存在符合拓扑次序的顶点序列,即为有向无环图。反之,非有向无环图
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int MAXN = 500;
vector<int> graph[MAXN];
int inDegree[MAXN]; //入度
bool TopologicalSort(int n){
queue<int> node;
for(int i = 0; i < n; i++){
if(inDegree[i] == 0){
node.push(i);
}
}
int number = 0;
while(!node.empty()){
int u = node.front();
node.pop();
number ++; //拓扑序列顶点加1
for(int i = 0; i < graph[u].size(); i++){
int v = graph[u][i];
inDegree[v]--; //后继顶点入度减一
if(inDegree[v] == 0){
node.push(v);
}
}
}
return n == number; //判断能否产生拓扑排序
}
int main(int argc, char** argv) {
int n, m;
while(scanf("%d %d", &n, &m) != EOF){
if(n == 0 && m == 0){
break;
}
memset(graph, 0, sizeof(graph));
memset(inDegree, 0, sizeof(inDegree));
while(m--){
int from, to;
scanf("%d %d", &from, &to);
graph[from].push_back(to);
inDegree[to]++;
}
if(TopologicalSort(n)){
printf("YES\n");
}else{
printf("NO\n");
}
}
return 0;
}