An implementation of the Ford-Fulkerson max-flow algorithm.Supports maximum flow as well as minimum-cost maximum flow.

Required Ruby Version

None

Authors

Paul Hemberger, Victor Costan

Versions

  1. 1.0.1

    1. source

      1. 1.0.1 source February 23, 2013 (4 KB)
  2. 1.0.0

    1. source

      1. 1.0.0 source February 23, 2013 (4 KB)
  3. 1.0.0.pre

    1. source

      1. 1.0.0.pre source February 23, 2013 (3.5 KB)

SHA 256 checksum

← Previous version