54#ifndef GUM_GRAPH_CYCLE_DETECTION_H
55#define GUM_GRAPH_CYCLE_DETECTION_H
79 template < GUM_DiGraphable G >
92 template < GUM_UndiGraphable G >
C++20 concepts for aGrUM graph interfaces.
bool hasUndirectedCycle(const G &g)
Returns true if g contains at least one undirected cycle.
Sequence< NodeId > topologicalOrder(const G &g)
Returns a topological ordering of the nodes of g (Kahn's algorithm).
Header file of gum::Sequence, a class for storing (ordered) sequences of objects.