A re-implementation of the BCT algorithm from this paper in Rust.
Sampling is done using this library and solving is done with avarice.
This is not the canonical/reference implementation! I re-implemented this as a learning exercise, and it is likely significantly slower than the authors' code. Please do not use this in comparisons of running time performance to the BCT algorithm.
The graph input is expected to be in Capngraph format. See the linked repository for conversion tools.
The cost/benefit inputs are constructed using the included binary.
Obviously, the method is taken from here. The code itself is wholly mine at this point, and is made available under the BSD 3-Clause License.