Expand description
Algorithms on graphs.
Structs§
- DFS
- Depth-first search over a finite graph.
Enums§
- Traversal
Direction - An enum which parameterises the traversal direction for the depth first traversal function.
Functions§
- bounded_
simple_ paths - Iterates over all simple paths of bounded length between two vertices.
- simple_
paths - Iterates over all simple paths between two vertices of a finite graph.
- spec_
order - Arrange some or all elements of a graph in specialization order.
- spec_
order_ all - Arrange all the elements of a finite graph in specialization order.
- toposort
- Computes a topological sorting for a given graph.