mcmf 2.0.0

This crate is for solving instances of the minimum cost maximum flow problem. It uses the network simplex algorithm from the LEMON graph optimization library.
Documentation 
1
2
3
4
5
6
7
8
9
10
11

extern crate gcc;

fn main() {
    let mut config = gcc::Build::new();
    config.opt_level(3);
    config.cpp(true);
    config.file("bindings.cpp");
    config.include(".");
    config.compile("libflow.a");
    println!("cargo:rerun-if-changed=lemon");
}