陈止风的博客

来源自我的博客 http://www.yingzinanfei.com/2017/04/07/dijkstrasuanfaqiudanyuanzuiduanlujing/#include <stdio.h>#include <limits.h>int main(){ int n, m; scanf("%d%d", &n, &m); int e[10][10]; //

来源自我的博客 http://www.yingzinanfei.com/2017/04/07/bellman-fordsuanfaheduilieyouhuaspfaqiudanyuanzuiduanlujing/#include <stdio.h>#include <limits.h>int main(){ int n, m; scanf("%d%d", &n, &m);

来源自我的博客 http://www.yingzinanfei.com/2017/04/07/tugedianqiujiewenti/#include <stdio.h>int flag[10];int num[10]; // 记录结点的访问时间次序int index; // 时间int low[10]; // 记录结点不过父结点能访问到的最早顶点// 割点算法核心vo