Expand description
A library for basic graph data structures and algorithms.
Re-exports
pub use self::traits::Digraph;
pub use self::traits::Graph;
pub use self::traits::IndexDigraph;
pub use self::traits::IndexGraph;
pub use self::traits::NumberedDigraph;
pub use self::traits::NumberedGraph;
pub use self::adapters::reverse;
pub use self::adapters::Network;
pub use self::adapters::ReverseDigraph;
pub use crate::builder::Buildable;
pub use crate::builder::Builder;
pub use self::linkedlistgraph::LinkedListGraph;
pub use self::vecgraph::VecGraph;
pub use self::attributes::AttributedGraph;
pub use self::attributes::EdgeAttributes;
pub use self::attributes::NodeAttributes;
Modules
- Graph adapters.
- Abstraction of neighboring edges.
- General algorithms working on graphs.
- Extend a graph with attributes.
- Compute a maximum weight branching.
- Traits for constructing graphs.
- Graph classes Some common graph classes.
- Some traits and implementations of data structures to be used in algorithms.
- Reading files in DIMACS format.
- Visualizing graphs.
- A linked-list based graph implementation.
- Maximum Network Flow algorithms.
- Minimum Cost Flow algorithms.
- Read and write routines for the MPS format.
- Minimum spanning tree algorithms.
- Graph search algorithms.
- Shortest path algorithms.
- Reading files in
SteinLib
format. - A small module to read graphs from ascii art.
- Traits for graph data structures.
Type Aliases
- The default graph type.