aGrUM
3.3.2
a C++ library for (probabilistic) graphical models
Toggle main menu visibility
cycleDetection.h
Go to the documentation of this file.
1
/****************************************************************************
2
* This file is part of the aGrUM/pyAgrum library. *
3
* *
4
* Copyright (c) 2005-2026 by *
5
* - Pierre-Henri WUILLEMIN(_at_LIP6) *
6
* - Christophe GONZALES(_at_AMU) *
7
* *
8
* The aGrUM/pyAgrum library is free software; you can redistribute it *
9
* and/or modify it under the terms of either : *
10
* *
11
* - the GNU Lesser General Public License as published by *
12
* the Free Software Foundation, either version 3 of the License, *
13
* or (at your option) any later version, *
14
* - the MIT license (MIT), *
15
* - or both in dual license, as here. *
16
* *
17
* (see https://agrum.gitlab.io/articles/dual-licenses-lgplv3mit.html) *
18
* *
19
* This aGrUM/pyAgrum library is distributed in the hope that it will be *
20
* useful, but WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, *
21
* INCLUDING BUT NOT LIMITED TO THE WARRANTIES MERCHANTABILITY or FITNESS *
22
* FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE *
23
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER *
24
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, *
25
* ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR *
26
* OTHER DEALINGS IN THE SOFTWARE. *
27
* *
28
* See LICENCES for more details. *
29
* *
30
* SPDX-FileCopyrightText: Copyright 2005-2026 *
31
* - Pierre-Henri WUILLEMIN(_at_LIP6) *
32
* - Christophe GONZALES(_at_AMU) *
33
* SPDX-License-Identifier: LGPL-3.0-or-later OR MIT *
34
* *
35
* Contact : info_at_agrum_dot_org *
36
* homepage : http://agrum.gitlab.io *
37
* gitlab : https://gitlab.com/agrumery/agrum *
38
* *
39
****************************************************************************/
40
41
54
#ifndef GUM_GRAPH_CYCLE_DETECTION_H
55
#define GUM_GRAPH_CYCLE_DETECTION_H
56
57
#include <utility>
58
#include <vector>
59
60
#include <
agrum/agrum.h
>
61
62
#include <
agrum/base/core/sequence.h
>
63
#include <
agrum/base/graphs/graphConcepts.h
>
64
65
namespace
gum::graph
{
66
67
// =========================================================================
68
// Directed graphs (GUM_DiGraphable)
69
// =========================================================================
70
79
template
< GUM_DiGraphable G >
80
Sequence< NodeId >
topologicalOrder
(
const
G& g);
81
82
// =========================================================================
83
// Undirected graphs (GUM_UndiGraphable)
84
// =========================================================================
85
92
template
< GUM_UndiGraphable G >
93
bool
hasUndirectedCycle
(
const
G& g);
94
95
}
// namespace gum::graph
96
97
#include <
agrum/base/graphs/algorithms/generic/cycleDetection_tpl.h
>
98
99
#endif
// GUM_GRAPH_CYCLE_DETECTION_H
agrum.h
cycleDetection_tpl.h
graphConcepts.h
C++20 concepts for aGrUM graph interfaces.
gum::graph
Definition
bayesBall.h:79
gum::graph::hasUndirectedCycle
bool hasUndirectedCycle(const G &g)
Returns true if g contains at least one undirected cycle.
Definition
cycleDetection_tpl.h:88
gum::graph::topologicalOrder
Sequence< NodeId > topologicalOrder(const G &g)
Returns a topological ordering of the nodes of g (Kahn's algorithm).
Definition
cycleDetection_tpl.h:49
sequence.h
Header file of gum::Sequence, a class for storing (ordered) sequences of objects.
aGrUM
3.3.2
© PHW&CG&others - 2022
DoXyGeN 1.18.0