摘要： 割点算法example1 21 31 42 52 63 73 84 94 80下面是算法运行过程 from 1 enter to the adj ares 2from 2 enter to the adj ares 5end 5return 2 is a cut node ,find subnet 1from 2 enter to the adj ares 6end 6return 2 is a cut node ,find subnet 2end 2from 1 enter to the adj ares 3from 3 enter to the adj ares 7end 7return 阅读全文

摘要： http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=60拓扑排序0度>1多解0度==1正常0度==0矛盾#include<iostream>#include<stdio.h>#include<queue>#include<string>#include<algorithm>#include<cstring>using namespace std;int vis[30],d[30],adj[30][30];int m,n,flag,ok,pos;stri 阅读全文