aGrUM
3.3.2
a C++ library for (probabilistic) graphical models
Toggle main menu visibility
PDAG_inl.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
#pragma once
42
43
50
51
// to ease IDE parser
52
#include <
agrum/base/core/exceptions.h
>
53
#include <
agrum/base/graphs/PDAG.h
>
54
55
namespace
gum
{
56
57
INLINE
PDAG
&
PDAG::operator=
(
const
PDAG
& g) {
58
// avoid self assignment
59
if
(
this
!= &g) {
60
MixedGraph::operator=
(g);
61
GUM_OP_CPY(
PDAG
);
62
}
63
64
return
*
this
;
65
}
66
67
INLINE
PDAG
&
PDAG::operator=
(
PDAG
&& g) {
68
if
(
this
!= &g) {
69
MixedGraph::operator=
(std::move(g));
70
GUM_OP_MOV(
PDAG
);
71
}
72
return
*
this
;
73
}
74
75
INLINE
void
PDAG::addArc
(
const
NodeId
tail,
const
NodeId
head) {
76
if
(head == tail) {
77
GUM_ERROR
(
InvalidDirectedCycle
,
"Add a mono-cycle in a PDAG for node "
<< head)
78
}
79
if
(this->
hasDirectedPath
(head, tail)) {
80
GUM_ERROR
(
InvalidDirectedCycle
,
81
"Add a directed cycle in a PDAG : between "
<< head <<
" and "
<< tail)
82
}
83
if
(this->
hasMixedReallyOrientedPath
(head, tail)) {
84
GUM_ERROR
(InvalidPartiallyDirectedCycle,
85
"Add a partial directed cycle in a PDAG : between "
<< head <<
" and "
<< tail)
86
}
87
88
// checking whether tail and head do belong to the graph is performed
89
// within class DiGraph
90
MixedGraph::addArc
(tail, head);
91
}
92
93
INLINE
void
PDAG::addEdge
(
const
NodeId
tail,
const
NodeId
head) {
94
if
(head == tail) {
GUM_ERROR
(
InvalidDirectedCycle
,
"Add a mono-cycle in a PDAG !"
) }
95
96
if
(this->
hasMixedReallyOrientedPath
(head, tail)
97
|| this->
hasMixedReallyOrientedPath
(tail, head)) {
98
GUM_ERROR
(InvalidPartiallyDirectedCycle,
99
"Add a partial directed cycle in a PDAG : between "
<< head <<
" and "
<< tail)
100
}
101
102
// checking whether tail and head do belong to the graph is performed
103
// within class DiGraph
104
MixedGraph::addEdge
(tail, head);
105
}
106
}
/* namespace gum */
PDAG.h
Base classes for partially directed acyclic graphs.
gum::DiGraph::hasDirectedPath
bool hasDirectedPath(NodeId from, NodeId to) const
checks whether there exists a directed path from from to to
Definition
diGraph.cpp:114
gum::DiGraph::addArc
void addArc(const NodeId tail, const NodeId head) override
insert a new arc into the directed graph
Definition
diGraph_inl.h:59
gum::EdgeGraphPart::addEdge
virtual void addEdge(NodeId n1, NodeId n2)
insert a new edge into the EdgeGraphPart
Definition
edgeGraphPart_inl.h:72
InvalidDirectedCycle
Exception : existence of a directed cycle in a graph.
gum::MixedGraph::operator=
MixedGraph & operator=(const MixedGraph &g)
copy operator
Definition
mixedGraph_inl.h:57
gum::PDAG::addEdge
void addEdge(NodeId first, NodeId second) final
insert a new edge into the partially directed graph
Definition
PDAG_inl.h:93
gum::PDAG::addArc
void addArc(NodeId tail, NodeId head) final
insert a new arc into the directed graph
Definition
PDAG_inl.h:75
gum::PDAG::operator=
PDAG & operator=(const PDAG &g)
copy operator
Definition
PDAG_inl.h:57
gum::PDAG::PDAG
PDAG(Size nodes_size=HashTableConst::default_size, bool nodes_resize_policy=true, Size arcs_size=HashTableConst::default_size, bool arcs_resize_policy=true, Size edges_size=HashTableConst::default_size, bool edges_resize_policy=true)
default constructor
Definition
PDAG.cpp:60
gum::PDAG::hasMixedReallyOrientedPath
bool hasMixedReallyOrientedPath(NodeId n1, NodeId n2) const
returns true if a mixed edge/directed arc path from node1 to node2 in the arc/edge set exists with at...
Definition
PDAG.cpp:106
exceptions.h
aGrUM's exceptions
GUM_ERROR
#define GUM_ERROR(type, msg)
Definition
exceptions.h:76
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