gdsl 0.2.0

GDSL is a graph data-structure library including graph containers, connected node strutures and efficient algorithms on those structures. Nodes are independent of a graph container and can be used as connected smart pointers.
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

[[bench]]
harness = false
name = "graph_benchmark"
[dependencies.ahash]
version = "0.8.0"

[dependencies.min-max-heap]
version = "1.3.0"

[dependencies.serde]
version = "1.0.144"
[dev-dependencies.criterion]
version = "0.3.6"

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

[dev-dependencies.serde_cbor]
version = "0.11.2"

[dev-dependencies.serde_json]
version = "1.0.85"

[package]
authors = ["Julius Koskela <me@juliuskoskela.dev>"]
categories = ["data-structures", "algorithms", "mathematics", "science"]
description = "GDSL is a graph data-structure library including graph containers,\nconnected node strutures and efficient algorithms on those structures.\nNodes are independent of a graph container and can be used as connected\nsmart pointers.\n"
edition = "2021"
keywords = ["data-structures", "graphs", "algorithms", "containers", "graph-theory"]
license = "MIT/Apache-2.0"
name = "gdsl"
readme = "README.md"
repository = "https://github.com/juliuskoskela/gdsl"
resolver = "2"
version = "0.2.0"