1、并查集:经典食物链:https://blog.csdn.net/freezhanacmore/article/details/8767413
2、强联通分图,tarjan,割点:
tarjan求lca(最近公共祖先):https://blog.csdn.net/lw277232240/article/details/77017517 Tarjan Algorithm 的时间复杂度为O(E+V).
tarjan求强连通分量:https://blog.csdn.net/lw277232240/article/details/73251092
https://blog.csdn.net/sentimental_dog/article/details/53790582
https://blog.csdn.net/qq_34374664/article/details/77488976
割点:https://blog.csdn.net/lw277232240/article/details/73251092
割点模板题:https://blog.csdn.net/AXuan_K/article/details/46692121
tarjan缩点,有向无环图,GCD:http://www.cnblogs.com/shzr/p/9259695.html
题目链接:https://vjudge.net/contest/244425#problem/G
(G - The Largest Clique UVA - 11324)
链式前向星版本:https://blog.csdn.net/li1615882553/article/details/79760325
链式前向星:https://blog.csdn.net/Binary_Heap/article/details/78209086
3、网络流:
Dinic:http://www.cnblogs.com/SYCstudio/p/7260613.html