Crate fera_graph
source ·Expand description
Graph data structures and algorithms.
Modules
Collection of algorithms.
Generate arbitrary graphs to be use in quickcheck tests.
Builder to create user defined, standard and random graphs.
Random selection of vertices and edges.
Extension traits for std types.
Graph traits and implementations.
Support for generic algorithms parameters.
The fera graph prelude.
Traits and implementation for properties (key to values mapping).
Edge and vertex sets.
Union-find (disjoint-set) data structure.
Macros
Creates a new graph with
n
vertices and the specified edges.Functions
Returns the iterator’s item with maximum property value or
None
if the iterator is empty.Returns the maximum property value associated with the iterator’s items or
None
if the
iterator is empty.Returns the iterator’s item with minimum property value or
None
if the iterator is empty.Returns the minimum property value associated with the iterator’s items or
None
if the
iterator is empty.Returns the sum of the property values of the iterator’s items.