lctree 0.3.4

Rust implementation of Link-Cut-Tree: self-balancing data structure to maintain a forest of rooted trees.
Documentation
[[bench]]
harness = false
name = "benchmark"
path = "benches/benchmark.rs"

[dependencies]

[dev-dependencies.criterion]
version = "0.5.1"

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

[dev-dependencies.rand_derive2]
version = "0.1.21"

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

[package]
authors = ["Kayumov A.I. <kayumovabduaziz@gmail.com>"]
autobenches = false
autobins = false
autoexamples = false
autolib = false
autotests = false
build = false
categories = ["algorithms", "data-structures"]
description = "Rust implementation of Link-Cut-Tree: self-balancing data structure to maintain a forest of rooted trees."
documentation = "https://docs.rs/lctree"
edition = "2021"
exclude = ["./github"]
homepage = "https://github.com/azizkayumov/lctree"
keywords = ["tree", "dynamic-connectivity"]
license = "Apache-2.0"
name = "lctree"
readme = "README.md"
repository = "https://github.com/azizkayumov/lctree"
rust-version = "1.63"
version = "0.3.4"

[[test]]
name = "test_base"
path = "tests/test_base.rs"

[[test]]
name = "test_path_aggr"
path = "tests/test_path_aggr.rs"

[[test]]
name = "test_path_custom"
path = "tests/test_path_custom.rs"

[[test]]
name = "test_random"
path = "tests/test_random.rs"