递归求解拓扑全部序列

题目描述链接：https://pintia.cn/problem-sets/994805342720868352/problems/994805343043829760

在求解所有的拓扑序列时，发现这是一个递归的过程，所以可以用递归求解

#include"stdafx.h"
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
const int maxn = 1005;
int innode[maxn] = { 0 };//记录一个顶点的入度
vector<int> adj[maxn];//邻接表存储图
int vertexnum, edgenum;
vector<int> path[maxn];//拓扑排序序列
int k = 0;
vector<int> tempath;
bool vis[maxn] = { false };//标记是否被访问
void DFS() {//递归求解拓扑全部排序序列,所有序列保存到path数组中
	if (tempath.size() == vertexnum) {//递归边界
		for (int i = 0; i < vertexnum; i++) {
			path[k].push_back(tempath[i]);
		}
		k++;
		return;
	}
	for (int u = 1; u <= vertexnum; u++) {
		if (innode[u] == 0 && vis[u]==false) {
			tempath.push_back(u);//加入到路径中
			vis[u] = true;//标记此点已被访问
			for (int j = 0; j < adj[u].size(); j++) {
				int v = adj[u][j];
				innode[v]--;
			}
			DFS();
			//回溯
			for (int j = 0; j < adj[u].size(); j++) {
				int v = adj[u][j];
				innode[v]++;
			}
			vis[u] = false;
			tempath.pop_back();
		}
	}
}
bool judge(int topo[]) {//判断是否为topo序列的函数
	for (int i = 0; i < k; i++) {
		int j;
		for (j = 0; j < path[i].size(); j++) {
			if (topo[j] != path[i][j]) break;
		}
		if (j == path[i].size()) return true;//如果都匹配上
	}
	return false;
}
int main() {
	cin >> vertexnum >> edgenum;
	for (int i = 0; i < edgenum; i++) {
		int Start, End;
		cin >> Start >> End;
		adj[Start].push_back(End);
		innode[End]++;
	}
	DFS();
	int m;
	cin >> m;
	int topo[maxn];
	vector<int> recordindex;//记录不符合拓扑排序的序号
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < vertexnum; j++) {
			cin >> topo[j];
		}
		if (judge(topo) == false) recordindex.push_back(i);
	}
	for (int i = 0; i < recordindex.size(); i++) {//输出不符号topo排序的序号
		cout << recordindex[i];
		if (i < recordindex.size()-1) cout << " ";
	}
	return 0;
}

注：用以上递归求解这道题目，有一个测试样例会超时。（不妨试试将递归解法改成非递归解法？利用栈）

----------------------------------------------------------------更新线

啊啊啊哈哈哈哈哈，经过一番思考，以上解法实在是复杂（不过写dfs的时候还是经过了一番思考，不亏不亏），看了别人的思路，下面给出这道题的正确解法：

#include"stdafx.h"
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
const int maxn = 1005;
int innode[maxn] = { 0 };//记录一个顶点的入度
vector<int> adj[maxn];//邻接表存储图
int vertexnum, edgenum;
bool judge(int topo[],int innode[]) {//判断是否为拓扑序列
	int testinnode[maxn];
	for (int i = 1; i <= vertexnum; i++) {
		testinnode[i] = innode[i];
	}
	for (int i = 1; i <= vertexnum; i++) {
		int v = topo[i];
		if (testinnode[v] != 0) return false;
		else {
			for (int j = 0; j < adj[v].size(); j++) {
				int u = adj[v][j];
				testinnode[u]--;
			}
		}
	}
	return true;
}
int main() {
	cin >> vertexnum >> edgenum;
	for (int i = 0; i < edgenum; i++) {
		int Start, End;
		cin >> Start >> End;
		adj[Start].push_back(End);
		innode[End]++;
	}
	int m;
	cin >> m;
	int topo[maxn];
	vector<int> recordindex;//记录不符合topo排序的序号
	for (int i = 0; i < m; i++) {
		for (int j = 1; j <= vertexnum; j++) {
			cin >> topo[j];
		}
		if (judge(topo,innode) == false) recordindex.push_back(i);
	}
	for (int i = 0; i < recordindex.size(); i++) {//输出不符号topo排序的序号
		cout << recordindex[i];
		if (i < recordindex.size()-1) cout << " ";
	}
	return 0;
}