Skip to main content

Module acyclic

petgraph

Module acyclic 

Source
Expand description

A wrapper around graph types that enforces an acyclicity invariant.

Modules§

order_map 🔒
A bijective map between node indices and a TopologicalPosition, to store the total topological order of the graph.

Macros§

impl_graph_traits 🔒

Structs§

Acyclic
A directed acyclic graph.
TopologicalPosition
A position in the topological order of the graph.

Enums§

AcyclicEdgeError
An error that can occur during edge addition for acyclic graphs.

Functions§

dfs 🔒
Traverse nodes in graph in DFS order, starting from start, for as long as the predicate valid_order returns true on the current node’s order.