Module graph_algorithms 

Algorithms on graphs.

Structs

DFS

Depth-first search over a finite graph.

ToposortData

Contains both the topologically-sorted stack of vertices and feedback vertices.

Enums

TraversalDirection

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_lenient

Implementation of topological sort which does not return an error when it encounters cycle.

toposort_strict

Implementation of topological sort which returns an error when it encounters a cycle.