arteezy / max-flow-swing

Solving maximum flow problem with a new algorithm (Belov). Using Dijksta algorithm to find shortest path. GUI written in Java Swing.

About

Solving maximum flow problem with a new algorithm. Using Dijksta algorithm to find shortest path. GUI written in Java Swing.

Usage

There is a standalone.jar application. Run store/NetworkFlow.jar or type:

java -jar store/NetworkFlow.jar

Building

Using Ant build system. To build standalone app:

ant package-for-store