aGrUM  0.14.2
partialOrderedEliminationSequenceStrategy_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  ***************************************************************************/
31 namespace gum {
32 
33 
34  // returns the current partial ordering
35  INLINE const List< NodeSet >*
37  return _subsets;
38  }
39 
40 
41  // indicates if a new partial ordering is needed
42  INLINE bool
44  noexcept {
45  return _partial_order_needed;
46  }
47 
48 
49 } /* namespace gum */
gum is the global namespace for all aGrUM entities
Definition: agrum.h:25
const List< NodeSet > * _subsets
the subsets constituting the partial ordering
bool isPartialOrderNeeded() const noexcept
indicates if a new partial ordering is needed
const List< NodeSet > * partialOrder() const noexcept
returns the current partial ordering
bool _partial_order_needed
indicate whether a new partial ordering is necessary for the elimination