C++模板目录 /OwO\
2016-08-16 11:29
183 查看
NOTE
-最短路
#1.spfa
http://blog.csdn.net/Skellinglock/article/details/52220689
#2.dijkstra http://blog.csdn.net/Skellinglock/article/details/52220783
#2+.dijkstra堆优化 http://blog.csdn.net/Skellinglock/article/details/52220911
#3.bellman-ford http://blog.csdn.net/Skellinglock/article/details/52220963
#4.floyd k应在最外层循环 （O-O）
-最小生成树
#1.prim http://blog.csdn.net/Skellinglock/article/details/52221017
#2.kruskal http://blog.csdn.net/Skellinglock/article/details/52220999
-高精（以拓展斐波那契为例）
http://blog.csdn.net/Skellinglock/article/details/52221094[/u]
-归并排序&求逆序对
http://blog.csdn.net/Skellinglock/article/details/52221209
-快速幂
http://blog.csdn.net/Skellinglock/article/details/52221276[/u]
-RMQ（倍增）
http://blog.csdn.net/Skellinglock/article/details/52221301
-最短路
#1.spfa
http://blog.csdn.net/Skellinglock/article/details/52220689
#2.dijkstra http://blog.csdn.net/Skellinglock/article/details/52220783
#2+.dijkstra堆优化 http://blog.csdn.net/Skellinglock/article/details/52220911
#3.bellman-ford http://blog.csdn.net/Skellinglock/article/details/52220963
#4.floyd k应在最外层循环 （O-O）
-最小生成树
#1.prim http://blog.csdn.net/Skellinglock/article/details/52221017
#2.kruskal http://blog.csdn.net/Skellinglock/article/details/52220999
-高精（以拓展斐波那契为例）
http://blog.csdn.net/Skellinglock/article/details/52221094[/u]
-归并排序&求逆序对
http://blog.csdn.net/Skellinglock/article/details/52221209
-快速幂
http://blog.csdn.net/Skellinglock/article/details/52221276[/u]
-RMQ（倍增）
http://blog.csdn.net/Skellinglock/article/details/52221301
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 