Max-flow-swing is a project mainly written in Java, it's free.
Solving maximum flow problem with a new algorithm (Belov). Using Dijksta algorithm to find shortest path. GUI written in Java Swing.
Solving maximum flow problem with a new algorithm. Using Dijksta algorithm to find shortest path. GUI written in Java Swing.
There is a standalone.jar application. Run store/NetworkFlow.jar or type:
java -jar store/NetworkFlow.jarUsing Ant build system. To build standalone app:
ant package-for-store