lapjv 0.3.0

Linear Assignmment Problem solve using Jonker-Volgenant algorithm
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 = "2024"
name = "lapjv"
version = "0.3.0"
authors = ["Andrii Dmytrenko <andrii.dmytrenko@deliveroo.co.uk>"]
build = false
include = [
    "**/*.rs",
    "Cargo.toml",
    "README.md",
]
autolib = false
autobins = false
autoexamples = false
autotests = false
autobenches = false
description = "Linear Assignmment Problem solve using Jonker-Volgenant algorithm"
homepage = "https://github.com/Antti/lapjv-rust"
documentation = "https://docs.rs/lapjv"
readme = "README.md"
license = "MIT"
repository = "https://github.com/Antti/lapjv-rust.git"

[badges.github]
branch = "master"
repository = "Antti/lapjv-rust"

[badges.maintenance]
status = "as-is"

[features]
nightly = []

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

[dependencies.log]
version = "0.4"

[dependencies.ndarray]
version = "0.16"

[dependencies.num-traits]
version = "0.2"

[dev-dependencies.rand]
version = "0.9"