Crate: mcmf 2.0.0

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.
Readme: README.md
License: MIT
Repository: https://github.com/zxqfl/flow
Edition: 2015
Checksum: 8cb289e5187a41de06144d7dd0e1c11f07f047fb7406b507bb365e6a6c378d93
Yanked: false

Dependencies:

Crate file analysis

Compressed crate size: 430kb

Valid: true

Checksum matches: true

Tokei lines of code count

Tokei output:

Language	Total lines	Code	Comments	Blank lines
Autoconf	32	9	18	5
C Header	86165	48637	24859	12669
C++	4372	3332	394	646
CMake	91	75	0	16
Markdown	39	39	0	0
Rust	445	322	87	36
TOML	24	12	11	1
Total:	91168	52426	25369	13373

Dependency analysis

Direct dependencies: 1

Transitive dependencies: 1

Cargofox