aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
edgeCode.h
Go to the documentation of this file.
1/****************************************************************************
2 * This file is part of the aGrUM/pyAgrum library. *
3 * *
4 * Copyright (c) 2005-2025 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-2025 *
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
48#ifndef GUM_EDGE_CODE_H
49#define GUM_EDGE_CODE_H
50
51#include <ostream>
52
53#include <agrum/agrum.h>
54
56
57namespace gum {
58
59 namespace prm {
60
61 namespace gspan {
62
71
72 struct EdgeCode {
86
91 EdgeCode(const EdgeCode& source);
92
94 ~EdgeCode();
95
98
101
104
107
110
112 std::string name;
113
118 bool isForward() const;
119
124 bool isBackward() const;
125
131 EdgeCode& operator=(const EdgeCode& source);
132
138 bool operator==(const EdgeCode& code) const;
139
145 bool operator!=(const EdgeCode& code) const;
146
152 bool operator<(const EdgeCode& code) const;
153 };
154
161 std::ostream& operator<<(std::ostream& out, const EdgeCode& code);
162
163 } /* namespace gspan */
164 } /* namespace prm */
165} /* namespace gum */
166
167#ifndef GUM_NO_INLINE
169#endif // GUM_NO_INLINE
170
171#endif /* GUM_EDGE_CODE_H */
Inline implementation of the EdgeCode class.
some utils for topology : NodeId, Edge, Arc and consorts ...
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Definition types.h:74
Size NodeId
Type for node ids.
std::ostream & operator<<(std::ostream &out, const DFSCode &code)
Print code in out.
Definition DFSCode.cpp:59
namespace for all probabilistic relational models entities
Definition agrum.h:68
gum is the global namespace for all aGrUM entities
Definition agrum.h:46
represent a DFS code used by gspan.
Definition edgeCode.h:72
Size l_i
The label of the first node in the code.
Definition edgeCode.h:103
NodeId i
The DFS subscript of the first node in the code.
Definition edgeCode.h:97
bool operator==(const EdgeCode &code) const
Equality operator.
Size l_ij
The label of the edge in the code.
Definition edgeCode.h:106
std::string name
The string version of this EdgeCode.
Definition edgeCode.h:112
bool isForward() const
Returns true if this EdgeCode is a forward edge.
EdgeCode(NodeId i, NodeId j, Size l_i, Size l_ij, Size l_j)
Default constructor.
NodeId j
The DFS subscript of the second node in the code.
Definition edgeCode.h:100
bool isBackward() const
Returns true if this EdgeCode is a backward edge.
EdgeCode & operator=(const EdgeCode &source)
Copy operator.
bool operator<(const EdgeCode &code) const
Lesser than operator.
bool operator!=(const EdgeCode &code) const
Difference operator.
Size l_j
The label of the second node in the code.
Definition edgeCode.h:109