blossom 0.1.2

Implementation of the Blossom algorithm to get a maximum matching in an undirected graph
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

# 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 believe there's an error in this file please file an
# issue against the rust-lang/cargo repository. If you're
# editing this file be aware that the upstream Cargo.toml
# will likely look very different (and much more reasonable)

[package]
name = "blossom"
version = "0.1.2"
authors = ["Wiebe Cnossen <wiebe.cnossen@gmail.com>"]
description = "Implementation of the Blossom algorithm to get a maximum matching in an undirected graph"
readme = "Readme.md"
license = "MIT"
repository = "https://nest.pijul.com/WiebeCnossen/blossom"
[dependencies.rand]
version = "^0.3.15"