Crate bit_gossip

Pathfinding library for calculating all node pairs’ shortest paths in an unweighted undirected graph.

See prim and graph modules for more information.

Features

• parallel: Enable parallelism using Rayon; this feature is enabled by default.

Re-exports

pub use prim::Graph128;

pub use prim::Graph128Builder;

pub use prim::Graph16;

pub use prim::Graph16Builder;

pub use prim::Graph32;

pub use prim::Graph32Builder;

pub use prim::Graph64;

pub use prim::Graph64Builder;

pub use graph::Graph;

pub use graph::GraphBuilder;

Modules

bitvec

bit vector implementations for internal use.

graph

general-use graph data structure and its builder.

maze

contains functions to build a maze.

prim

graph implementations using primitive data types.

Functions

edge_id

Given two node IDs, return a tuple of the two IDs in ascending order.