HDU 3342 Legal or not (to determine whether the graph is topological and orderly for a given graph)

Code:

#include <cstdio> #include <cstring>using namespace std;int n,m;int mat[105][105];int in[105];int stack[105    ],top;void topo () {top=0;            for (int i=0; i<n; i++) {if (in[i]==0) {stack[++top]=i;        In[i]=-1;    }} int cnt=0;        while (top!=0) {int j=stack[top--];        cnt++;            for (int i=0; i<n; i++) {if (Mat[j][i]) {in[i]-= (mat[j][i]);                } if (in[i]==0) {stack[++top]=i;            In[i]=-1;    }}} if (cnt==n) printf ("yes\n"); else printf ("no\n");} int main () {while (scanf ("%d%d", &n,&m) && (n| |        m)) {memset (mat,0,sizeof (MAT));        memset (In,0,sizeof (in));            for (int i=0; i<m; i++) {int A, B;            scanf ("%d%d", &a,&b);            mat[a][b]++;        in[b]++;    } topo (); } return 0;}

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

HDU 3342 Legal or not (to determine whether the graph is topological and orderly for a given graph)