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
12
13

[build-dependencies.gcc]
version = "0.3"

[package]
authors = ["Jacob Jackson <jacobbfjackson@gmail.com>"]
categories = ["algorithms"]
description = "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."
keywords = ["graph", "flow", "optimization"]
license = "MIT"
name = "mcmf"
readme = "README.md"
repository = "https://github.com/zxqfl/flow"
version = "2.0.0"