1002: 拓扑排序
题目描述:
假设给我们一个任意的图,它可能是也可能不是DAG(有向无圈图),推广拓扑排序算法,以使得给定有向图G的输入,它的输出是以下两者之一:
(a) 一个拓扑排序,于是确定了G为DAG;
或者
(b) G中的一个圈,于是确定了G不是DAG.
注意到输出的解可能不是唯一的,输出任意一个答案即可。
输入:
第一行两个数n,m,代表节点数和边数
m行,每行两个数代表一条有向边
测试数据范围:(1<=n<=50,0<=m<2500)
输出:
YES
一个拓扑序,数字之间用逗号分隔。
或者
NO
一个圈,数字之间用逗号分隔。
提示:
考虑不连通,自环,重边。
Case1:
YES //( DAG)
1,2,3,4,5 //(Topological Ordering)
Case2:
NO //(Not A DAG)
1,3,4,2,1 //(Cycle)
代码:
#include<iostream>
#include<stdlib.h>
#include<vector>
using namespace std;
vector<int> circle;
class Node
{
public:
int v;
int count;
Node *last;
Node *next;
Node() {}
Node(int v)
{
this->v = v;
count = 0;
last = NULL;
next = NULL;
}
};
int findStart(vector<Node*> G)
{
for (int i = 0; i < G.size(); i++)
{
if (G[i]->count == 0)return i;
}
return -1;
}
void find(int **g, int n, int start)
{
for (int i = 0; i < n; i++)
{
if (g[start][i] != 0)
{
circle.push_back(start + 1);
if (circle[0] == start + 1 && circle.size()>1)
{
cout << "NO" << endl;
for (int i = 0; i < circle.size() - 1; i++)
{
cout << circle[i] << ",";
}
cout << circle[circle.size() - 1] << endl;
exit(0);
}
find(g, n, i);
}
}
if (circle.size()>0)circle.pop_back();
return;
}
int main()
{
int n, m;
cin >> n >> m;
if (n == 0)return 0;
vector<Node *> G;
for (int i = 0; i < n; i++)
{
Node *newNode = new Node(i + 1);
G.push_back(newNode);
}
for (int i = 0; i < m; i++)
{
int p, q;
cin >> p >> q;
Node *newNode = new Node(p);
Node *curr = G[q - 1];
bool judge = false;
while (curr->next != NULL)
{
if (curr->v == p)
{
judge = true;
break;
}
curr = curr->next;
}
if (judge)continue;
curr->next = newNode;
newNode->last = curr;
G[q - 1]->count++;
}
vector<int> order;
while (findStart(G) >= 0)
{
int start = G[findStart(G)]->v;
order.push_back(start);
vector<Node*>::iterator it = G.begin() + findStart(G);
G.erase(it);
for (int i = 0; i < G.size(); i++)
{
Node *curr = G[i]->next;
while (curr != NULL)
{
if (curr->v == start)
{
curr->last->next = curr->next;
if (curr->next)curr->next->last = curr->last;
G[i]->count--;
}
curr = curr->next;
}
}
}
if (G.size() == 0)
{
cout << "YES" << endl;
for (int i = 0; i < order.size() - 1; i++)
{
cout << order[i] << ",";
}
cout << order[order.size() - 1] << endl;
}
else
{
int **g = new int*[n];
for (int i = 0; i < n; i++)