bit_gossip 0.0.2

Pathfinding library for calculating all node pairs' shortest paths in an unweighted undirected graph.
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

[dependencies.paste]
version = "1.0"

[dependencies.rayon]
optional = true
version = "1.10.0"

[features]
default = ["parallel"]
parallel = ["dep:rayon"]

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

[package]
authors = ["Jack Lee <jack.y.l.dev@gmail.com>"]
autobenches = false
autobins = false
autoexamples = false
autotests = false
build = false
categories = ["algorithms", "data-structures", "mathematics", "game-development"]
description = "Pathfinding library for calculating all node pairs' shortest paths in an unweighted undirected graph."
documentation = "https://docs.rs/bit_gossip"
edition = "2021"
keywords = ["pathfinding", "graph", "search", "all-pairs", "shortest-path"]
license = "MIT OR Apache-2.0"
name = "bit_gossip"
readme = "README.md"
repository = "https://github.com/poonesnerfect/bit_gossip"
rust-version = "1.56"
version = "0.0.2"