Expand description
graph structures and algorithms
Re-exports§
pub use self::shortest_path::ShortestPathExt;pub use self::shortest_path::ShortestPathSemiRing;
Modules§
- adjacency_
list 🔒 - assignment 🔒
- bipartite_
matching 🔒 - closure 🔒
- dulmage_
mendelsohn_ 🔒decomposition - edge_
list 🔒 - general_
matching 🔒 - general_
weighted_ 🔒matching - graph_
base 🔒 - graphvis 🔒
- grid 🔒
- low_
link 🔒 - maximum_
flow 🔒 - minimum_
cost_ 🔒flow - minimum_
spanning_ 🔒arborescence - minimum_
spanning_ 🔒tree - network_
simplex 🔒 - order 🔒
- project_
selection_ 🔒problem - shortest_
path - sparse_
graph 🔒 - steiner_
tree 🔒 - strongly_
connected_ 🔒component - topological_
sort 🔒 - two_
satisfiability 🔒
Structs§
- Adjacency
List Graph - Adjacency
List Graph Scanner - Bipartite
Matching - Closure
Graph - Dinic
- Dinic
Builder - Edge
List Graph - Graph represented by a list of edges.
- Edge
List Graph Scanner - General
Matching - General
Weighted Matching - Grid
Adjacency - Grid
Graph - LowLink
- Neighbor
- A neighboring vertex and the label of the arc used to reach it.
- Network
Simplex - Primal
Dual - Primal
Dual Builder - Project
Selection Problem - Sparse
Graph - Static Sparse Graph represented as Compressed Sparse Row.
- Sparse
Graph Builder - Sparse
Graph Scanner - Steiner
Tree Builder - Steiner
Tree Output - Strongly
Connected Component - Tree
Graph Scanner - TwoSatisfiability
- Usize
Graph
Enums§
Traits§
- Directed
Graph - A graph whose adjacency relation represents directed arcs.
- EdgeMap
- Graph
- A finite graph whose outgoing arcs can be iterated without allocation.
- Graph
Order Ext - Sparse
Graph Construction - Steiner
Tree Ext - Steiner
Tree Parent Policy - Topological
Sort Ext - Vertex
Map
Functions§
- dulmage_
mendelsohn_ decomposition - minimum_
assignment - Returns the minimum cost and a column assigned to each row of a square cost matrix.