cycleDetection.h File Reference

Generic cycle-detection algorithms for aGrUM graphs. More...

#include <utility>
#include <vector>
#include <agrum/agrum.h>
#include <agrum/base/core/sequence.h>
#include <agrum/base/graphs/graphConcepts.h>
#include <agrum/base/graphs/algorithms/generic/cycleDetection_tpl.h>

Include dependency graph for cycleDetection.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces
namespace	gum
	gum is the global namespace for all aGrUM entities
namespace	gum::graph

Functions
template<GUM_DiGraphable G>
Sequence< NodeId >	gum::graph::topologicalOrder (const G &g)
	Returns a topological ordering of the nodes of g (Kahn's algorithm).
template<GUM_UndiGraphable G>
bool	gum::graph::hasUndirectedCycle (const G &g)
	Returns true if g contains at least one undirected cycle.

Detailed Description

Generic cycle-detection algorithms for aGrUM graphs.

All functions live in namespace gum::graph and are constrained by the concepts defined in graphConcepts.h :

GUM_DiGraphable — topologicalOrder GUM_UndiGraphable — hasUndirectedCycle

Author

Pierre-Henri WUILLEMIN(_at_LIP6) and Christophe GONZALES(_at_AMU)

Definition in file cycleDetection.h.