integer-blossom 1.2.0

Minimum-weight perfect matching (blossom algorithm) on a general graph, with integer edge weights
Documentation
# THIS FILE IS AUTOMATICALLY GENERATED BY CARGO
#
# When uploading crates to the registry Cargo will automatically
# "normalize" Cargo.toml files for maximal compatibility
# with all versions of Cargo and also rewrite `path` dependencies
# to registry (e.g., crates.io) dependencies.
#
# If you are reading this file be aware that the original Cargo.toml
# will likely look very different (and much more reasonable).
# See Cargo.toml.orig for the original contents.

[package]
edition = "2021"
rust-version = "1.87"
name = "integer-blossom"
version = "1.2.0"
authors = ["Robin Morisset"]
build = false
autolib = false
autobins = false
autoexamples = false
autotests = false
autobenches = false
description = "Minimum-weight perfect matching (blossom algorithm) on a general graph, with integer edge weights"
readme = "README.md"
keywords = [
    "matching",
    "blossom",
    "graph",
    "optimization",
    "pairing",
]
categories = [
    "algorithms",
    "mathematics",
]
license = "MIT"
repository = "https://github.com/robingeek/OpenShogiPairings"

[lib]
name = "integer_blossom"
path = "src/lib.rs"