aGrUM
3.3.2
a C++ library for (probabilistic) graphical models
Toggle main menu visibility
graphConcepts.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
55
#ifndef GUM_GRAPH_CONCEPTS_H
56
#define GUM_GRAPH_CONCEPTS_H
57
58
#include <concepts>
59
60
#include <
agrum/base/graphs/graphElements.h
>
61
62
namespace
gum
{
63
66
73
template
<
typename
T >
74
concept
GUM_NodeGraphable
=
requires
(
const
T g,
NodeId
id) {
75
{ g.existsNode(
id
) } -> std::convertible_to< bool >;
76
{ g.size() } -> std::convertible_to< Size >;
77
{ g.empty() } -> std::convertible_to< bool >;
78
};
79
86
template
<
typename
T >
87
concept
GUM_DiGraphable
=
GUM_NodeGraphable< T >
&&
requires
(
const
T g,
NodeId
u,
NodeId
v) {
88
{ g.existsArc(u, v) } -> std::convertible_to< bool >;
89
{ g.parents(u) } -> std::convertible_to< const NodeSet& >;
90
{ g.children(u) } -> std::convertible_to< const NodeSet& >;
91
};
92
99
template
<
typename
T >
100
concept
GUM_UndiGraphable
=
GUM_NodeGraphable< T >
&&
requires
(
const
T g,
NodeId
u,
NodeId
v) {
101
{ g.existsEdge(u, v) } -> std::convertible_to< bool >;
102
{ g.neighbours(u) } -> std::convertible_to< const NodeSet& >;
103
};
104
111
template
<
typename
T >
112
concept
GUM_MixedGraphable
=
GUM_DiGraphable< T >
&&
GUM_UndiGraphable< T >
;
113
115
116
}
// namespace gum
117
118
#endif
// GUM_GRAPH_CONCEPTS_H
gum::GUM_DiGraphable
Concept for directed graphs (arcs with parents/children).
Definition
graphConcepts.h:87
gum::GUM_MixedGraphable
Concept for mixed graphs (both arcs and edges).
Definition
graphConcepts.h:112
gum::GUM_NodeGraphable
Concept for any graph that exposes node-level queries.
Definition
graphConcepts.h:74
gum::GUM_UndiGraphable
Concept for undirected graphs (edges with neighbours).
Definition
graphConcepts.h:100
graphElements.h
some utils for topology : NodeId, Edge, Arc and consorts ...
gum::NodeId
Size NodeId
Type for node ids.
Definition
graphElements.h:117
gum
gum is the global namespace for all aGrUM entities
Definition
agrum.h:46
aGrUM
3.3.2
© PHW&CG&others - 2022
DoXyGeN 1.18.0