exact-covers 0.3.0

An implementation of Knuth's algorithm for solving the exact cover problem with colors
Documentation
[dev-dependencies.smallvec]
version = "2.0.0-alpha.6"

[[example]]
name = "domino_chessboard"
path = "examples/domino_chessboard.rs"

[[example]]
doc-scrape-examples = true
name = "langford_pairs"
path = "examples/langford_pairs.rs"

[[example]]
doc-scrape-examples = true
name = "polycube_packing"
path = "examples/polycube_packing.rs"

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

[package]
authors = ["Hugo Sanz González <hugo@hgsg.me>"]
autobenches = false
autobins = false
autoexamples = false
autolib = false
autotests = false
build = false
categories = ["algorithms", "data-structures", "mathematics"]
description = "An implementation of Knuth's algorithm for solving the exact cover problem with colors"
documentation = "https://docs.rs/exact-covers"
edition = "2021"
homepage = "https://github.com/hsanzg/exact-covers"
keywords = ["exact-cover", "color-constraints", "dancing-cells", "combinatorial-search"]
license = "MIT"
name = "exact-covers"
readme = "README.md"
repository = "https://github.com/hsanzg/exact-covers"
version = "0.3.0"

[package.metadata.docs.rs]
cargo-args = ["-Zunstable-options", "-Zrustdoc-scrape-examples"]
rustdoc-args = ["--html-in-header", "misc/katex-header.html"]