有两个算法题,
POJ 1860 换零钱问题
这里的是有两个算法,Bellman-Ford算法 O(n^3),
SPFA是Shortest Path Faster Algorithm O(KM)
解题过程:
https://www.cnblogs.com/Hayasaka/p/14294126.html
还有POJ 2240
https://www.cnblogs.com/Hayasaka/p/14294126.html
https://blog.youkuaiyun.com/Oh233/article/details/42222739
https://www.cnblogs.com/lienus/p/4273422.html
http://poj.org/problem?id=2240
关于SPFA算法详解
https://blog.youkuaiyun.com/muxidreamtohit/article/details/7894298
论文:
https://francis-press.com/papers/258