拓扑排序
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
int const MAXN = 1010;
queue<int> q;
int maze[MAXN][MAXN],d[MAXN];
void Clear(){
while(!q.empty()){
q.pop();
}
memset(maze,0,sizeof(maze));
memset(d,0,sizeof(d));
}
int TopoSort(int n){
int du[MAXN],vis[MAXN];
memset(du,0,sizeof(du));
memset(vis,0,sizeof(vis));
for(int i = 1;i <= n;i++){
if(!d[i]){
......
阅读全文