啊哈算法
关注
分享
扫一扫
小虎仔的csdn
欢迎来到算法的世界
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
图的遍历 深度优先搜索 and 广度优先搜索
深度优先搜索#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#define inf 0x3f3f3f3fusing namespace std;const int maxn = 100;int vis[101],sum,n,e[101...原创 2019-03-30 09:54:57 · 135 阅读 · 0 评论 -
城市地图----图的深度优先遍历
笔记#include <iostream>#include <cstdio>#include <algorithm>#include <cmath>#include <cstring>#include <queue>#include <stack>#include <set>#incl...原创 2019-03-30 12:27:16 · 345 阅读 · 0 评论 -
最小转机数 ---- 图的广度优先遍历
笔记#include <iostream>#include <cstdio>#include <algorithm>#include <cmath>#include <cstring>#include <queue>#include <stack>#include <set>#incl...原创 2019-03-30 12:46:26 · 283 阅读 · 0 评论 -
Floyd任意两点之间的最短距离
笔记可以处理带有负值的图，但是不能处理有负权环的图#include <iostream>#include <cstdio>#include <algorithm>#include <cmath>#include <cstring>#include <queue>#include <stack>#i...原创 2019-03-30 13:24:56 · 299 阅读 · 0 评论 -
Dijkstra 单源最短路
#include <iostream>#include <cstdio>#include <algorithm>#include <cmath>#include <cstring>#include <queue>#include <stack>#include <set>#include...原创 2019-03-30 13:48:03 · 165 阅读 · 0 评论 -
建立堆以及堆排序
#include <iostream>#include <cstdio>#include <algorithm>#include <cmath>#include <cstring>#include <queue>#include <stack>#include <set>#include...原创 2019-03-31 12:39:30 · 216 阅读 · 0 评论 -
并查集 模板加小例题
#include <iostream>#include <cstdio>#include <algorithm>#include <cmath>#include <cstring>#include <queue>#include <stack>#include <set>#include...原创 2019-03-31 15:01:01 · 144 阅读 · 0 评论 -
最小生成树
#include <iostream>#include <cstdio>#include <algorithm>#include <cmath>#include <cstring>#include <queue>#include <stack>#include <set>#include...原创 2019-03-31 17:40:32 · 129 阅读 · 0 评论