graaf 0.32.2

Functions and types for working with graphs
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

[[bench]]
harness = false
name = "add_edge"
path = "benches/op/add_edge.rs"

[[bench]]
harness = false
name = "count_all_edges"
path = "benches/op/count_all_edges.rs"

[[bench]]
harness = false
name = "cross_country"
path = "benches/algo/distances_weighted/cross_country.rs"

[[bench]]
harness = false
name = "shortest_path_1"
path = "benches/algo/distances_weighted/shortest_path_1.rs"

[[bench]]
harness = false
name = "small_graph_1"
path = "benches/algo/distances_weighted/small_graph_1.rs"

[[bench]]
harness = false
name = "distances_unweighted_graph_1"
path = "benches/algo/distances_unweighted/graph_1.rs"

[dependencies]
[dev-dependencies.divan]
version = "0.1.14"

[dev-dependencies.proptest]
version = "1.4.0"

[features]
adjacency_matrix = []
default = ["adjacency_matrix"]

[lib]

[package]
authors = ["Bas Dirks <bas.dirks@protonmail.com>"]
categories = ["algorithms", "data-structures", "mathematics"]
description = "Functions and types for working with graphs"
documentation = "https://docs.rs/graaf"
edition = "2021"
keywords = ["bfs", "dijkstra", "graph"]
license = "MIT OR Apache-2.0"
name = "graaf"
readme = "README.md"
repository = "https://github.com/bsdrks/graaf"
version = "0.32.2"
[profile.test.package.proptest]
opt-level = 3