aGrUM  0.14.2
eliminationSequenceStrategy_inl.h
Go to the documentation of this file.
1 /***************************************************************************
2  * Copyright (C) 2005 by Christophe GONZALES and Pierre-Henri WUILLEMIN *
3  * {prenom.nom}_at_lip6.fr *
4  * *
5  * This program is free software; you can redistribute it and/or modify *
6  * it under the terms of the GNU General Public License as published by *
7  * the Free Software Foundation; either version 2 of the License, or *
8  * (at your option) any later version. *
9  * *
10  * This program is distributed in the hope that it will be useful, *
11  * but WITHOUT ANY WARRANTY; without even the implied warranty of *
12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
13  * GNU General Public License for more details. *
14  * *
15  * You should have received a copy of the GNU General Public License *
16  * along with this program; if not, write to the *
17  * Free Software Foundation, Inc., *
18  * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
19  ***************************************************************************/
30 namespace gum {
31 
32 
34  INLINE UndiGraph* EliminationSequenceStrategy::graph() const noexcept {
35  return _graph;
36  }
37 
38 
40  INLINE const NodeProperty< Size >*
42  return _domain_sizes;
43  }
44 
45 
46 } /* namespace gum */
UndiGraph * _graph
the graph to be triangulated
gum is the global namespace for all aGrUM entities
Definition: agrum.h:25
The class for generic Hash Tables.
Definition: hashTable.h:676
UndiGraph * graph() const noexcept
returns the current graph
const NodeProperty< Size > * domainSizes() const noexcept
returns the current domain sizes
Base class for undirected graphs.
Definition: undiGraph.h:106
const NodeProperty< Size > * _domain_sizes
the domain sizes of the variables/nodes