Release notes
This release is focused on improving performance for sparse inputs, i.e. input graphs for which only some edges are available for matching.
To this end, we make it possible to provide sparse inputs in to Solver
, as well as the specialized ShortestPathSolver
and PseudoflowSolver
. Inputs may be given in compressed sparse row (CSR) format but can also be converted from a dense representation. The former approach will have higher performance if a sparse representation is already available.
New features
- Introduce sparse matrix functionality in
SparseMatrixInt
andSparseMatrixDouble
. - Make it possible to control whether or not cost inputs can be manipulated by the solvers to the cost of creating copies. (#1)
API changes
- Cost inputs are now kept intact by default, where they could previously be overwritten. (#1)