【研究】参考文献

本章 纯理论，适合 学术，理论，研究 人士阅读。

如果您不是上述人士，请大略 浏览，或直接 跳过 仅供日后 查找 ，不适合细读。

我们应该查阅什么文献来具体实现BFM算法

https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2015/lecture-notes/MIT6_046JS15_lec11.pdf

Lecture Notes | Design and Analysis of Algorithms | Electrical Engineering and Computer Science | MIT OpenCourseWareMIT OpenCourseWare

https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2015/lecture-notes/MIT6_046JS15_writtenlec11.pdf

Lecture Notes | Design and Analysis of Algorithms | Electrical Engineering and Computer Science | MIT OpenCourseWareMIT OpenCourseWare

https://courses.csail.mit.edu/6.006/spring11/rec/rec15.pdf

https://courses.csail.mit.edu/6.006/spring11/lectures/lec15.pdf

https://courses.csail.mit.edu/6.006/fall11/lectures/lecture17.pdf

https://courses.csail.mit.edu/6.046/fall02/handouts.html

10/30/02	Handout 19: Problem Set 6	PostScript	Adobe PDF
11/15/02	Handout 22: Problem Set 6 Solutions	PostScript	Adobe PDF

https://courses.csail.mit.edu/6.046/fall03/handouts.html

10/31/03	Handout 19: Problem Set 6	PostScript	Adobe PDF
11/14/03	Handout 24: Problem Set 6 Solutions	PostScript	Adobe PDF

我们应该查阅什么文献来具体应用BFM算法

Shortest Paths. Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.algs4.cs.princeton.edu

http://alvand.basu.ac.ir/~dezfoulian/files/DataStructures & Algorithms/
https://www.cs.princeton.edu/~rs/

书后练习题相关代码。

https://algs4.cs.princeton.edu/44sp/

4.4.12 Adapt the DirectedCycle and Topological classes from Section 4.2 to use the EdgeweightedDigraph and DirectedEdge APIs of this section, thus implementing EdgeWeightedCycleFinder and EdgeWeightedTopological classes.
https://algs4.cs.princeton.edu/44sp/EdgeWeightedDirectedCycle.java.html
https://algs4.cs.princeton.edu/42digraph/DirectedCycle.java.html
https://algs4.cs.princeton.edu/44sp/Topological.java.html

算法 第四版(algorithms 4th edition ) 这本书有配套的习题答案吗？

https://www.zhihu.com/question/27876056