随笔分类 - 连通图
摘要：参考：https://blog.csdn.net/sxy201658506207/article/details/78779045 前向星：https://www.cnblogs.com/Renyi-Fan/p/7508063.html https://blog.csdn.net/lookqaq/a
阅读全文
摘要：spfa算法：https://www.cnblogs.com/shadowland/p/5870640.html https://blog.csdn.net/qq_40061421/article/details/82054784 https://blog.csdn.net/anlian523/ar
阅读全文
摘要：https://blog.csdn.net/heiyeshuwu/article/details/52882777
阅读全文
摘要：Description A number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintains a list
阅读全文
摘要：参考：https://blog.csdn.net/shuangde800/article/details/7987134 https://blog.csdn.net/gfvod/article/details/51506901 https://blog.csdn.net/u011466175/art
阅读全文
摘要：#include//用于求一个图存在多少个强连通分量 #include #include using namespace std; #define maxn 1000000 vectormp[maxn]; int vis[maxn];//标记该点是否被tarjan int dfn[maxn];//时间戳 int low[maxn];//low为该点能追溯到的最根的祖先 int n,m,c...
阅读全文
