aph_disjoint_set 0.1.1

Disjoint set implementation with optimized memory usage and ability to detach elements.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38

# 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.70"
name = "aph_disjoint_set"
version = "0.1.1"
authors = ["AngelicosPhosphoros <xuzin.timur@gmail.com>"]
description = "Disjoint set implementation with optimized memory usage and ability to detach elements."
documentation = "https://docs.rs/aph_disjoint_set"
readme = "Readme.md"
keywords = [
    "disjoint-set",
    "union-find",
    "graph-algorithms",
]
categories = ["data-structures"]
license = "MIT OR Apache-2.0"
repository = "https://foss.heptapod.net/angelicos_phosphoros/aph-disjoint-set"
resolver = "1"

[dependencies]

[dev-dependencies.itertools]
version = "0.10.5"

[dev-dependencies.rstest]
version = "0.17.0"
default-features = false