什么是拓扑排序?拓扑排序的原理及实现
拓扑排序有什么作用呢?我们在上各种课程的时候,有的课程必须在别的课程学完之后才能学习这门课程,如果课程比较少,你能飞得清楚上课的先后顺序,那么如果课程非常多,你不能直接就看出来这些课怎么上,那么怎么办,当然是用拓扑排序了,拓扑排序就能解决这个问题。但是拓扑排序的结果不唯一。
思想:
(1)从有向图中选取一个没有前驱的顶点,并输出之;
(2)从有向图中删去此顶点以及所有以它为尾的弧;
重复上述两步,直至图空,或者图不空但找不到无前驱的顶点为止。没有前驱 – 入度为零,删除顶点及以它为尾的弧– 弧头顶点的入度减1。
例题 A:
代码:
/*Genealogical tree POJ - 2367 */
#include<string.h>
#include<stdio.h>
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
#define maxn 105
queue<int>q;
vector<int>v[maxn], re;
int degree[maxn];
void TopSort(int n){
for(int i = 1; i <= n; i++){
if(degree[i] == 0)q.push(i);
}
re.clear();
while(!q.empty()){
int t = q.front();
q.pop();
re.push_back(t);
for(int i = 0; i < v[t].size(); i++){
degree[v[t][i]]--;
if(!degree[v[t][i]])q.push(v[t][i]);
}
}
int k = re.size();
for(int i = 0; i < k; i++){
if(i != 0)cout<<" ";
cout<<re[i];
}
cout<<endl;
}
int main(){
int n, m, k;
cin>>n;
memset(degree, 0, sizeof(degree));
for(int i = 0; i <= n; i++)v[i].clear();
for(int i = 1; i <= n; i++){
while(scanf("%d", &k) && k != 0){
degree[k]++;
v[i].push_back(k);
}
}
TopSort(n);
return 0;
}
例题B:
代码:
/*Ordering Tasks UVA - 10305 */
#include<string.h>
#include<stdio.h>
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
#define maxn 105
queue<int>q;
vector<int>v[maxn], re;
int degree[maxn];
void TopSort(int n)
{
for(int i = 1; i <= n; i++)
{
if(degree[i] == 0)q.push(i);
}
re.clear();
while(!q.empty())
{
int t = q.front();
q.pop();
re.push_back(t);
for(int i = 0; i < v[t].size(); i++)
{
degree[v[t][i]]--;
if(!degree[v[t][i]])q.push(v[t][i]);
}
}
int k = re.size();//判断是否存在回路
for(int i = 0; i < k; i++)
{
if(i != 0)cout<<" ";
cout<<re[i];
}
cout<<endl;
}
int main()
{
int n, m;
int max = 0;
while(cin>>n>>m && (m ||n))
{
for(int i = 1; i <= n; i++)v[i].clear();
memset(degree, 0, sizeof(degree));
for(int i = 1; i <= m; i++)
{
int a, b;
cin>>a>>b;
degree[b]++;
v[a].push_back(b);
}
TopSort(n);
}
return 0;
}
例题C:
题目:产生冠军
思想:找到入度为0的点是否为1.
代码:
/*产生冠军 HDU - 2094 */
#include<string.h>
#include<stdio.h>
#include<iostream>
#include<vector>
#include<queue>
#include<map>
using namespace std;
#define maxn 1005
vector<int>v[maxn], re;
int degree[maxn];
void TopSort(int n)
{
int cn = 0;
for(int i = 1; i <= n; i++)
{
if(degree[i] == 0)cn++;
}
if(cn == 1)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
int main()
{
int n;
string a, b;
while(scanf("%d", &n) && n != 0)
{
int cn = 0;
memset(degree, 0, sizeof(degree));
map<string, int>ma;
for(int i = 1; i <= n; i++)
{
cin>>a>>b;
if(!ma[a])
{
cn++;
ma[a] = cn;
}
if(!ma[b])
{
cn++;
ma[b] = cn;
}
//cout<<ma[a]<<" "<<ma[b]<<endl;
degree[ma[b]]++;
}
TopSort(cn);
}
return 0;
}
例题D:
题目:Legal or Not
代码:
/*Legal or Not HDU - 3342 */
#include<string.h>
#include<stdio.h>
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
#define maxn 105
queue<int>q;
vector<int>v[maxn], re;
int degree[maxn];
void TopSort(int n){
for(int i = 0; i < n; i++){
if(degree[i] == 0)q.push(i);
}
re.clear();
while(!q.empty()){
int t = q.front();
q.pop();
re.push_back(t);
for(int i = 0; i < v[t].size(); i++){
degree[v[t][i]]--;
if(!degree[v[t][i]])q.push(v[t][i]);
}
}
int k = re.size();
if(k == n)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
int main(){
int n, m;
while(cin>>n>>m && m && n){
for(int i = 0; i <= n; i++)v[i].clear();
memset(degree, 0, sizeof(degree));
for(int i = 1; i <= m;i++){
int a, b;
cin>>a>>b;
degree[b]++;
v[a].push_back(b);
}
TopSort(n);
}
return 0;
}
例题E:
题目:确定比赛名次
代码:
#include<bits/stdc++.h>
using namespace std;
vector<int>v[505];
priority_queue<int, vector<int>, greater<int> >q;
int degree[505];
void Topsort(int n)
{
for(int i = 1; i<= n; i++)
{
if(degree[i] == 0)q.push(i);
}
int cn = 0;
while(!q.empty())
{
int val = q.top();
q.pop();
if(cn != 0)cout<<" ";
cout<<val;
cn++;
for(int i = 0; i < v[val].size(); i++)
{
int k = v[val][i];
degree[k]--;
if(degree[k] == 0)q.push(k);
}
}
cout<<endl;
}
int main()
{
int n, m, a, b;
while(cin>>n>>m)
{
memset(degree, 0, sizeof(degree));
for(int i = 1; i <= n; i++)v[i].clear();
for(int i = 1; i <= m; i++)
{
cin>>a>>b;
v[a].push_back(b);
degree[b]++;
}
Topsort(n);
}
return 0;
}
例题F:
题解:http://www.cppblog.com/Davidlrzh/articles/115620.html
代码:
/*Labeling Balls POJ - 3687 */
#include<iostream>
#include<queue>
#include<stdio.h>
#include<string.h>
using namespace std;
#define maxn 210//本题的结果是球不动试出,按照球的顺序输出球排第几
priority_queue<int>q;
vector<int>v[maxn], re;
int degree[maxn],w[maxn];
void TopSort(int n){
for(int i = 1; i <= n; i++){
if(degree[i] == 0)q.push(i);
}
int cn = 0;
re.clear();
while(!q.empty()){
int t = q.top();
q.pop();
cn++;
re.push_back(t);
for(int i = 0; i < v[t].size(); i++){
degree[v[t][i]]--;
if(degree[v[t][i]] == 0)q.push(v[t][i]);
}
}
if(cn < n)cout<<-1<<endl;
else {
int k = re.size();
for(int i = k-1; i >= 0; i--){
w[re[i]] = k-i;
}
for(int i = 1; i <= k; i++){
if(i != 1)cout<<" ";
cout<<w[i];
}
cout<<endl;
}
}
int main(){
int T;
cin>>T;
while(T--){
int n, m, a, b;
memset(degree, 0, sizeof(degree));
cin>>n>>m;
for(int i = 0; i <= n; i++){
v[i].clear();
}
while(m--){
cin>>a>>b;
v[b].push_back(a);
degree[a]++;
}
TopSort(n);
}
return 0;
}
例题G:
题目:Reward
思路:本题一开始的时候我正向建图,在同一次循环下找到的入度为0的节点,是同一个级别的,记录一下他是属于第个级别,后来发现这么做会导致所有的数据都会往前倾,例如当a是一个孤立的起点的时候,这么做会把它当做一等节点,后来回顾上面的那道题,发现其实这道题也可以逆向建图,会使所有整个图向右倾斜,达到我们的要求
代码:
/*Genealogical tree POJ - 2367 */
#include<string.h>
#include<stdio.h>
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
#define maxn 10005
struct Node
{
int rate, id;//rate代表等级
} tmp;
queue<Node>q;
vector<Node>re;
vector<int>v[maxn];
int degree[maxn];
void TopSort(int n)
{
for(int i = 1; i <= n; i++)
{
if(degree[i] == 0)
{
tmp.id = i;
tmp.rate = 0;
q.push(tmp);
}
}
re.clear();
int flag = 0;
while(!q.empty())
{
tmp = q.front();
re.push_back(tmp);
q.pop();
int t = tmp.id;
int x = tmp.rate;
//cout<<"x"<<x<<" "<<t<<endl;
for(int i = 0; i < v[t].size(); i++)
{
degree[v[t][i]]--;
if(!degree[v[t][i]])
{
tmp.id = v[t][i];
tmp.rate = x+1;
q.push(tmp);
}
}
}
long long sum = n*888;
if(re.size() == n)
{
for(int i = 0; i < re.size(); i++)
{
//cout<<re[i].rate<<endl;
sum += re[i].rate;
}
cout<<sum<<endl;
}
else cout<<-1<<endl;
}
int main()
{
int n, m, k;
while(~scanf("%d %d", &n, &m))
{
memset(degree, 0, sizeof(degree));
for(int i = 0; i <= n; i++)v[i].clear();
for(int i = 1; i <= m; i++)
{
int a, b;
cin>>a>>b;
degree[a]++;
v[b].push_back(a);
}
TopSort(n);
}
return 0;
}