aGrUM  0.20.2
a C++ library for (probabilistic) graphical models
essentialGraph_inl.h
Go to the documentation of this file.
1 /**
2  *
3  * Copyright 2005-2020 Pierre-Henri WUILLEMIN(@LIP6) & Christophe GONZALES(@AMU)
4  * info_at_agrum_dot_org
5  *
6  * This library is free software: you can redistribute it and/or modify
7  * it under the terms of the GNU Lesser General Public License as published by
8  * the Free Software Foundation, either version 3 of the License, or
9  * (at your option) any later version.
10  *
11  * This library is distributed in the hope that it will be useful,
12  * but WITHOUT ANY WARRANTY; without even the implied warranty of
13  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14  * GNU Lesser General Public License for more details.
15  *
16  * You should have received a copy of the GNU Lesser General Public License
17  * along with this library. If not, see <http://www.gnu.org/licenses/>.
18  *
19  */
20 
21 
22 /** @file
23  * @brief Inline implementation of the class building the essential Graph from a
24  * DAGmodel
25  * @author Pierre-Henri WUILLEMIN(@LIP6) & Christophe GONZALES(@AMU)
26  *
27  */
28 
29 // to ease parsing by IDE
30 #include <agrum/BN/algorithms/essentialGraph.h>
31 
32 namespace gum {
33 
34  INLINE MixedGraph EssentialGraph::mixedGraph() { return mg__; }
35 
37  return mg__.parents(id);
38  }
39 
41  return mg__.children(id);
42  }
43 
45  return mg__.parents(ids);
46  }
47 
49  return mg__.children(ids);
50  }
51 
53  return mg__.neighbours(id);
54  }
55 
56 
58 
59  INLINE const ArcSet& EssentialGraph::arcs() const { return mg__.arcs(); }
60 
62 
63  INLINE const EdgeSet& EssentialGraph::edges() const { return mg__.edges(); }
64 
66 
67  INLINE Size EssentialGraph::size() const { return mg__.size(); }
68 
70  return mg__.nodes();
71  }
72 } // namespace gum
INLINE void emplace(Args &&... args)
Definition: set_tpl.h:669