aGrUM
3.2.0
a C++ library for (probabilistic) graphical models
Toggle main menu visibility
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-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
48
#ifndef GUM_EDGE_CODE_H
49
#define GUM_EDGE_CODE_H
50
51
#include <ostream>
52
53
#include <
agrum/agrum.h
>
54
55
#include <
agrum/base/graphs/graphElements.h
>
56
57
namespace
gum
{
58
59
namespace
prm
{
60
61
namespace
gspan
{
62
71
72
struct
GUM_PUBLIC_PRM
EdgeCode
{
85
EdgeCode
(
NodeId
i
,
NodeId
j
,
Size
l_i
,
Size
l_ij
,
Size
l_j
);
86
91
EdgeCode
(
const
EdgeCode
& source);
92
94
~EdgeCode
();
95
97
NodeId
i
;
98
100
NodeId
j
;
101
103
Size
l_i
;
104
106
Size
l_ij
;
107
109
Size
l_j
;
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
168
# include <
agrum/PRM/gspan/edgeCode_inl.h
>
169
#endif
// GUM_NO_INLINE
170
171
#endif
/* GUM_EDGE_CODE_H */
agrum.h
edgeCode_inl.h
Inline implementation of the EdgeCode class.
graphElements.h
some utils for topology : NodeId, Edge, Arc and consorts ...
gum::Size
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Definition
types.h:74
gum::NodeId
Size NodeId
Type for node ids.
Definition
graphElements.h:117
gum::prm::gspan
Definition
DFSCode.cpp:57
gum::prm::gspan::operator<<
std::ostream & operator<<(std::ostream &out, const DFSCode &code)
Print code in out.
Definition
DFSCode.cpp:59
gum::prm
namespace for all probabilistic relational models entities
Definition
agrum.h:68
gum
gum is the global namespace for all aGrUM entities
Definition
agrum.h:46
gum::prm::gspan::EdgeCode
represent a DFS code used by gspan.
Definition
edgeCode.h:72
gum::prm::gspan::EdgeCode::l_i
Size l_i
The label of the first node in the code.
Definition
edgeCode.h:103
gum::prm::gspan::EdgeCode::i
NodeId i
The DFS subscript of the first node in the code.
Definition
edgeCode.h:97
gum::prm::gspan::EdgeCode::operator==
bool operator==(const EdgeCode &code) const
Equality operator.
Definition
edgeCode_inl.h:92
gum::prm::gspan::EdgeCode::l_ij
Size l_ij
The label of the edge in the code.
Definition
edgeCode.h:106
gum::prm::gspan::EdgeCode::name
std::string name
The string version of this EdgeCode.
Definition
edgeCode.h:112
gum::prm::gspan::EdgeCode::isForward
bool isForward() const
Returns true if this EdgeCode is a forward edge.
Definition
edgeCode_inl.h:76
gum::prm::gspan::EdgeCode::EdgeCode
EdgeCode(NodeId i, NodeId j, Size l_i, Size l_ij, Size l_j)
Default constructor.
Definition
edgeCode_inl.h:57
gum::prm::gspan::EdgeCode::j
NodeId j
The DFS subscript of the second node in the code.
Definition
edgeCode.h:100
gum::prm::gspan::EdgeCode::isBackward
bool isBackward() const
Returns true if this EdgeCode is a backward edge.
Definition
edgeCode_inl.h:79
gum::prm::gspan::EdgeCode::operator=
EdgeCode & operator=(const EdgeCode &source)
Copy operator.
Definition
edgeCode_inl.h:82
gum::prm::gspan::EdgeCode::operator<
bool operator<(const EdgeCode &code) const
Lesser than operator.
Definition
edgeCode_inl.h:104
gum::prm::gspan::EdgeCode::operator!=
bool operator!=(const EdgeCode &code) const
Difference operator.
Definition
edgeCode_inl.h:98
gum::prm::gspan::EdgeCode::l_j
Size l_j
The label of the second node in the code.
Definition
edgeCode.h:109
aGrUM
3.2.0
© PHW&CG&others - 2022
DoXyGeN 1.18.0