Expand description
graph structures and algorithms
Structs§
- Adjacency
- Adjacency
List Graph - Adjacency
List Graph Scanner - Adjacency
View Iter From Eindex - Adjacency
View Iter From Value - Bipartite
Matching - Closure
Graph - Dinic
- Dinic
Builder - Edge
List Graph - Graph represented by a list of edges.
- Edge
List Graph Scanner - Grid
Graph - LowLink
- Option
Sp - Path
Folding Sp - Primal
Dual - Primal
Dual Builder - Project
Selection Problem - Sparse
Graph - Static Sparse Graph represented as Compressed Sparse Row.
- Sparse
Graph Builder - Sparse
Graph Scanner - Standard
Sp - Steiner
Tree Output - Strongly
Connected Component - Tree
Graph Scanner - TwoSatisfiability
- Usize
Graph - VIndex
- VIndex
WithE Index - VIndex
WithE Index Value - VIndex
With Value
Enums§
Traits§
- Adjacencies
- Adjacencies
With Eindex - Adjacencies
With Value - Adjacency
Index - Adjacency
Index With Eindex - Adjacency
Index With Value - Adjacency
View - EIndexed
Graph - EdgeMap
- Edge
Size - Edge
View - Edges
- Graph
Base - Shortest
Path Ext - Shortest
Path Semi Ring - Sparse
Graph Construction - Steiner
Tree Ext - Vertex
Map - Vertex
Size - Vertex
View - Vertices