Skip to content

timmh/maxflow

Repository files navigation

Maxflow

This is a web application to interactively visualize algorithms to solve the maximum flow problem. Currently, three algorithms are implemented: Edmonds–Karp, Ford–Fulkerson (depth-first) and Push–relabel. Each algorithm can be stepped through line-by-line and the resulting effects are visualized in a graph visualization powered by Cytoscape.js. The algorithms are implemented as generators to provide updated visualizations and can thus translate almost line-by-line to the visualized pseudocode.

How to develop

  • make sure you have installed node.js and npm
  • run npm install
  • run npm start

How to build and deploy

  • make sure you have installed node.js and npm
  • run npm install
  • run npm run build
  • host the build directory in the root of some HTTP server

License

This code is licensed under the MIT License.

Releases

No releases published

Packages

No packages published

Languages