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§
- adapters
- Graph adapters.
- adjacencies
- Abstraction of neighboring edges.
- algorithms
- General algorithms working on graphs.
- attributes
- Extend a graph with attributes.
- branching
- Compute a maximum weight branching.
- builder
- Traits for constructing graphs.
- classes
- Graph classes Some common graph classes.
- collections
- Some traits and implementations of data structures to be used in algorithms.
- dimacs
- Reading files in DIMACS format.
- draw
- Visualizing graphs.
- linkedlistgraph
- A linked-list based graph implementation.
- maxflow
- Maximum Network Flow algorithms.
- mcf
- Minimum Cost Flow algorithms.
- mps
- Read and write routines for the MPS format.
- mst
- Minimum spanning tree algorithms.
- search
- Graph search algorithms.
- shortestpath
- Shortest path algorithms.
- steinlib
- Reading files in
SteinLibformat. - string
- A small module to read graphs from ascii art.
- traits
- Traits for graph data structures.
- vecgraph
Type Aliases§
- Net
- The default graph type.