NETWORK FLOW

Link to the site

This site provides visualization of Ford-Fulkerson, Edmonds-Karp and Dinic algorithm

It lets you draw your own graph or use their example, choose source and target point, then see the demo along with pseudocode and description.

Link to the site

This site provides introduction and visualization of Ford-Fulkerson algorithm, along with runtime analysis

Link to the site

This site provides visualization of push-relabel algorithm in the same way

Link to the site

This site provides a visulization of network flow with shape similar to real pipelines

It lets you add nodes and adapt the flow to see what happens.

Link to the site

Another demo, but also show the results in the middle.

Link to the site

A demo that shows capacitity scaling. Flow network and residual network are shown on seperate graphs.

Link to the site

An solver made by a student with codes avaliable. Ford-Folkerson runs behind the scene.

Link to the site

An example of using network to solve real world problem related to maximum bipartite matching.