POJ 1094 Sortint it all out
#include
#include
#include
#include
#include
#include
using namespace std;
const int N=27;
bool graph[N][N],outdegree[N];
int indegree[N],n,m;
char s[N];
int topol_sort()
{
int index=0,count_exist
原创
2014-10-14 15:16:54 ·
434 阅读 ·
0 评论