Module fera_graph::algs

Collection of algorithms.

Re-exports

pub use self::components::Components;

pub use self::cycles::Cycles;

pub use self::degrees::Degrees;

pub use self::distances::Distances;

pub use self::kruskal::Kruskal;

pub use self::paths::Paths;

pub use self::prim::Prim;

pub use self::sets::Sets;

pub use self::trees::Trees;

Modules

components

Components related algorithms, including connectivity, cuts, etc.

cycles

Cycles related algorithms, including testing if a graph is acyclic.

degrees

Test if a graph is regular, find minimum and maximum degrees, etc.

distances

kruskal

Kruskal’s minimum spanning tree algorithm.

paths

Paths related algorithms, including find path between two vertices.

prim

Prim’s minimum spanning tree algorithm.

sets

Iterators for edge and vertex set complements.

trees

Trees related algortihms, including testing if a graph is a tree.