Expand description
An implementation of a graph data structure.
Structs§
- Graph
Info - Metadata about how the node fits in the schedule graph
Enums§
- Direction
- Edge direction.
Traits§
- Graph
Node Id - Types that can be used as node identifiers in a
DiGraph
/UnGraph
.
Functions§
- simple_
cycles_ in_ component - Returns the simple cycles in a strongly-connected component of a directed graph.
Type Aliases§
- DiGraph
- A
Graph
with directed edges of someGraphNodeId
N
. - UnGraph
- A
Graph
with undirected edges of someGraphNodeId
N
.