Edmonds-Karp Algorithm

The following resources were helpful in developing this project.

Edmonds-Karp Algorithm

• The WIKI page for Edmonds-Karp Algorithm
• Edmonds, Jack; Karp, Richard M. (1972). "Theoretical improvements in algorithmic efficiency for network flow problems". Journal of the ACM. Association for Computing Machinery. 19 (2): 248–264. doi:10.1145/321694.321699.
• Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms, Third Edition: The MIT Press.
• A wiki page on Edmonds-Karp

Ford-Fulkerson

• Ford, L.R.; Fulkerson, D.R. (1956). "Maximal flow through a network". Canadien Journal of Mathematics. 8: 399-404. doi:10.4153/CJM-1956-045-5.
• A wiki page for Ford-Fulkerson Algorithm
• An explaination of Ford-Fulkerson Algorithm
• A Network Flow Solver for Ford-Fulkerson
• A paper on applications of Maximum Flow Networks"

Web Development

• An excellent source of D3.js examples
• An introduction to D3.js
• A good resource for Web Development (w3schools.com)
• A visual equation editor that can generate MathML
• MathJax Documentatoin