integer-blossom 1.2.1

Minimum-weight perfect matching (blossom algorithm) on a general graph, with integer edge weights
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17

[package]
name = "integer-blossom"
description = "Minimum-weight perfect matching (blossom algorithm) on a general graph, with integer edge weights"
# Deliberately NOT inherited from the workspace: this crate is published to
# crates.io independently, so its semver tracks its own public API rather than the
# application's release cadence. Bump it only when the matching crate itself
# changes.
version = "1.2.1"
edition.workspace = true
license.workspace = true
repository.workspace = true
authors = ["Robin Morisset"]
readme = "README.md"
keywords = ["matching", "blossom", "graph", "optimization", "pairing"]
categories = ["algorithms", "mathematics"]
# `n.is_multiple_of(2)` in the public API was stabilized in Rust 1.87.
rust-version = "1.87"