更新图论
This commit is contained in:
49
README.md
49
README.md
@@ -372,25 +372,38 @@
|
||||
|
||||
通知:开始更新图论内容,图论部分还没有其他语言版本,欢迎录友们提交PR,成为contributor
|
||||
|
||||
### 深搜广搜
|
||||
1. [图论:理论基础](./problems/kamacoder/图论理论基础.md)
|
||||
2. [图论:深度优先搜索理论基础](./problems/kamacoder/图论深搜理论基础.md)
|
||||
3. [图论:所有可达路径](./problems/kamacoder/0098.所有可达路径.md)
|
||||
4. [图论:广度优先搜索理论基础](./problems/kamacoder/图论广搜理论基础.md)
|
||||
5. [图论:岛屿数量.深搜版](./problems/kamacoder/0099.岛屿的数量深搜.md)
|
||||
6. [图论:岛屿数量.广搜版](./problems/kamacoder/0099.岛屿的数量广搜.md)
|
||||
7. [图论:岛屿的最大面积](./problems/kamacoder/0100.岛屿的最大面积.md)
|
||||
8. [图论:孤岛的总面积](./problems/kamacoder/0101.孤岛的总面积.md)
|
||||
9. [图论:沉没孤岛](./problems/kamacoder/0102.沉没孤岛.md)
|
||||
10. [图论:水流问题](./problems/kamacoder/0103.水流问题.md)
|
||||
11. [图论:建造最大岛屿](./problems/kamacoder/0104.建造最大岛屿.md)
|
||||
12. [图论:字符串接龙](./problems/kamacoder/0110.字符串接龙.md)
|
||||
13. [图论:有向图的完全可达性](./problems/kamacoder/0105.有向图的完全可达性.md)
|
||||
14. [图论:岛屿的周长](./problems/kamacoder/0106.岛屿的周长.md)
|
||||
15. [图论:并查集理论基础](./problems/kamacoder/图论并查集理论基础.md)
|
||||
16. [图论:寻找存在的路径](./problems/kamacoder/0107.寻找存在的路径.md)
|
||||
17. [图论:冗余连接](./problems/kamacoder/0108.冗余连接.md)
|
||||
18. [图论:冗余连接II](./problems/kamacoder/0109.冗余连接II.md)
|
||||
19. [图论:最小生成树之prim](./problems/kamacoder/0053.寻宝-prim.md)
|
||||
20. [图论:最小生成树之kruskal](./problems/kamacoder/0053.寻宝-Kruskal.md)
|
||||
21. [图论:拓扑排序](./problems/kamacoder/0117.软件构建.md)
|
||||
22. [图论:dijkstra(朴素版)](./problems/kamacoder/0047.参会dijkstra朴素.md)
|
||||
23. [图论:dijkstra(堆优化版)](./problems/kamacoder/0047.参会dijkstra堆.md)
|
||||
24. [图论:Bellman_ford 算法](./problems/kamacoder/0094.城市间货物运输I.md)
|
||||
25. [图论:Bellman_ford 队列优化算法(又名SPFA)](./problems/kamacoder/0094.城市间货物运输I-SPFA.md)
|
||||
26. [图论:Bellman_ford之判断负权回路](./problems/kamacoder/0095.城市间货物运输II.md)
|
||||
27. [图论:Bellman_ford之单源有限最短路](./problems/kamacoder/0095.城市间货物运输II.md)
|
||||
28. [图论:Floyd 算法](./problems/kamacoder/0097.小明逛公园.md)
|
||||
29. [图论:A * 算法](./problems/kamacoder/0126.骑士的攻击astar.md)
|
||||
30. [图论:最短路算法总结篇](./problems/kamacoder/最短路问题总结篇.md)
|
||||
31. [图论:图论总结篇](./problems/kamacoder/图论总结篇.md)
|
||||
|
||||
* [图论:深度优先搜索理论基础](./problems/图论深搜理论基础.md)
|
||||
* [图论:797.所有可能的路径](./problems/0797.所有可能的路径.md)
|
||||
* [图论:广度优先搜索理论基础](./problems/图论广搜理论基础.md)
|
||||
* [图论:200.岛屿数量.深搜版](./problems/0200.岛屿数量.深搜版.md)
|
||||
* [图论:200.岛屿数量.广搜版](./problems/0200.岛屿数量.广搜版.md)
|
||||
* [图论:695.岛屿的最大面积](./problems/0695.岛屿的最大面积.md)
|
||||
* [图论:1020.飞地的数量](./problems/1020.飞地的数量.md)
|
||||
* [图论:130.被围绕的区域](./problems/0130.被围绕的区域.md)
|
||||
* [图论:417.太平洋大西洋水流问题](./problems/0417.太平洋大西洋水流问题.md)
|
||||
* [图论:827.最大人工岛](./problems/0827.最大人工岛.md)
|
||||
* [图论:127. 单词接龙](./problems/0127.单词接龙.md)
|
||||
* [图论:841.钥匙和房间](./problems/0841.钥匙和房间.md)
|
||||
* [图论:463. 岛屿的周长](./problems/0463.岛屿的周长.md)
|
||||
* [图论:并查集理论基础](./problems/图论并查集理论基础.md)
|
||||
* [图论:1971. 寻找图中是否存在路径](./problems/1971.寻找图中是否存在路径.md)
|
||||
* [图论:684.冗余连接](./problems/0684.冗余连接.md)
|
||||
* [图论:685.冗余连接II](./problems/0685.冗余连接II.md)
|
||||
|
||||
(持续更新中....)
|
||||
|
||||
|
||||
Reference in New Issue
Block a user