daggy 0.9.0

A directed acyclic graph data structure library. It is Implemented on top of petgraph's Graph data structure and attempts to follow similar conventions where suitable.
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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72

[[bench]]
name = "add_edges"
path = "benches/add_edges.rs"

[dependencies.petgraph]
default-features = false
version = "0.8"

[dependencies.serde]
optional = true
version = "1.0"

[features]
serde-1 = ["petgraph/serde-1", "serde"]
stable_dag = ["petgraph/stable_graph"]

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

[package]
authors = ["mitchmindtree <mitchell.nordine@gmail.com>"]
autobenches = false
autobins = false
autoexamples = false
autolib = false
autotests = false
build = false
description = "A directed acyclic graph data structure library. It is Implemented on top of petgraph's Graph data structure and attempts to follow similar conventions where suitable."
edition = "2018"
homepage = "https://github.com/mitchmindtree/daggy"
keywords = ["dag", "directed", "acyclic", "graph", "data-structure"]
license = "MIT/Apache-2.0"
name = "daggy"
readme = "README.md"
repository = "https://github.com/mitchmindtree/daggy.git"
version = "0.9.0"

[package.metadata.docs.rs]
all-features = true

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

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

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

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

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

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

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

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