Crate fera_graph

Graph data structures and algorithms.

Modules

algs

Collection of algorithms.

arbitrary

Generate arbitrary graphs to be use in quickcheck tests.

builder

Builder to create user defined, standard and random graphs.

choose

Random selection of vertices and edges.

ext

Extension traits for std types.

graphs

Graph traits and implementations.

params

Support for generic algorithms parameters.

prelude

The fera graph prelude.

props

Traits and implementation for properties (key to values mapping).

sets

Edge and vertex sets.

traverse

Traversal algorithms, including BFS, DFS, etc.

unionfind

Union-find (disjoint-set) data structure.

Macros

graph

Creates a new graph with n vertices and the specified edges.

Functions

max_by_prop

Returns the iterator’s item with maximum property value or None if the iterator is empty.

max_prop

Returns the maximum property value associated with the iterator’s items or None if the iterator is empty.

min_by_prop

Returns the iterator’s item with minimum property value or None if the iterator is empty.

min_prop

Returns the minimum property value associated with the iterator’s items or None if the iterator is empty.

sum_prop

Returns the sum of the property values of the iterator’s items.