aGrUM  0.20.3
a C++ library for (probabilistic) graphical models
partialOrderedTriangulation.cpp
Go to the documentation of this file.
1 /**
2  *
3  * Copyright (c) 2005-2021 by 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 class for graph triangulations for which we enforce a given partial
24  * ordering on the nodes eliminations.
25  *
26  * @author Christophe GONZALES(@AMU) and Pierre-Henri WUILLEMIN(@LIP6)
27  */
28 
29 #include <agrum/agrum.h>
30 
31 #include <agrum/tools/graphs/algorithms/triangulations/partialOrderedTriangulation.h>
32 
33 namespace gum {
34 
35  // default constructor
39  bool minimality) :
41  // for debugging purposes
43  }
44 
45  // constructor with a given graph
47  const UndiGraph* theGraph,
48  const NodeProperty< Size >* dom,
49  const List< NodeSet >* partial_order,
52  bool minimality) :
57 
58  // for debugging purposes
60  }
61 
62  // copy constructor
67  // for debugging purposes
69  }
70 
71  // move constructor
74  // for debugging purposes
76  }
77 
78  /// virtual copy constructor
80  return new PartialOrderedTriangulation(
81  static_cast< const PartialOrderedEliminationSequenceStrategy& >(
84  }
85 
86  /// virtual copy constructor
88  return new PartialOrderedTriangulation(*this);
89  }
90 
91  /// destructor
93  // for debugging purposes
95  }
96 
97  /// initialize the triangulation data structures for a new graph
99  const NodeProperty< Size >* domsizes) {
103  }
104 
105  /// sets the sequence of elimination
110  }
111 
112  /// the function called to initialize the triangulation process
118  }
119 
120 } /* namespace gum */
INLINE void emplace(Args &&... args)
Definition: set_tpl.h:643