图论
飞不起的弱鸡
这个作者很懒,什么都没留下…
展开
-
有向图强连通分量Tarjan模板
#include #include #include using namespace std; const int maxn=10010; const int maxm=1000010; int cnt,p[maxn]; struct node { int v,next; }E[maxm]; int n,m; int low[maxn],dfn[maxn]; int Stack[maxn]原创 2016-04-06 17:30:58 · 288 阅读 · 0 评论 -
hdu 4966 GGS-DDU (最小树形图)
Description Do you think this is a strange problem name? That is because you don't know its full name---'Good Good Study and Day Day Up!". Very famous sentence! Isn't it? Now "GGS-DDU" is lzqx原创 2016-08-10 20:38:24 · 344 阅读 · 0 评论 -
无向图的割点,割边,点双连通,边双连通模板
#include using namespace std; const int maxn = 100010; const int maxm = 500010; int num, p[maxn]; struct EDGE { int u, v, next; bool cut; EDGE() {} EDGE(int u, int v, int next, bool cu原创 2016-10-08 14:12:58 · 362 阅读 · 0 评论