Commit c0cc8278 authored by Christophe Gonzales's avatar Christophe Gonzales

Merge branch 'master' into feature/improvedScores

parents ba406101 fd6a709e
......@@ -37,8 +37,10 @@ namespace gum {
// Default constructor.
// Use the SimpleCPTGenerator for generating the BNs CPT.
template < typename GUM_SCALAR,
template < typename > class ICPTGenerator,
template < typename > class ICPTDisturber >
template < typename >
class ICPTGenerator,
template < typename >
class ICPTDisturber >
INLINE MaxInducedWidthMCBayesNetGenerator<
GUM_SCALAR,
ICPTGenerator,
......@@ -60,8 +62,10 @@ namespace gum {
}
template < typename GUM_SCALAR,
template < typename > class ICPTGenerator,
template < typename > class ICPTDisturber >
template < typename >
class ICPTGenerator,
template < typename >
class ICPTDisturber >
INLINE MaxInducedWidthMCBayesNetGenerator< GUM_SCALAR,
ICPTGenerator,
ICPTDisturber >::
......@@ -91,8 +95,10 @@ namespace gum {
// Destructor.
template < typename GUM_SCALAR,
template < typename > class ICPTGenerator,
template < typename > class ICPTDisturber >
template < typename >
class ICPTGenerator,
template < typename >
class ICPTDisturber >
INLINE MaxInducedWidthMCBayesNetGenerator<
GUM_SCALAR,
ICPTGenerator,
......@@ -102,8 +108,10 @@ namespace gum {
}
template < typename GUM_SCALAR,
template < typename > class ICPTGenerator,
template < typename > class ICPTDisturber >
template < typename >
class ICPTGenerator,
template < typename >
class ICPTDisturber >
bool MaxInducedWidthMCBayesNetGenerator< GUM_SCALAR,
ICPTGenerator,
ICPTDisturber >::__checkConditions() {
......@@ -120,8 +128,10 @@ namespace gum {
}
template < typename GUM_SCALAR,
template < typename > class ICPTGenerator,
template < typename > class ICPTDisturber >
template < typename >
class ICPTGenerator,
template < typename >
class ICPTDisturber >
INLINE Size
MaxInducedWidthMCBayesNetGenerator< GUM_SCALAR,
ICPTGenerator,
......@@ -130,8 +140,10 @@ namespace gum {
return _maxlog10InducedWidth;
}
template < typename GUM_SCALAR,
template < typename > class ICPTGenerator,
template < typename > class ICPTDisturber >
template < typename >
class ICPTGenerator,
template < typename >
class ICPTDisturber >
INLINE void MaxInducedWidthMCBayesNetGenerator<
GUM_SCALAR,
ICPTGenerator,
......
......@@ -37,8 +37,10 @@ namespace gum {
// Default constructor.
// Use the SimpleCPTGenerator for generating the BNs CPT.
template < typename GUM_SCALAR,
template < class > class ICPTGenerator,
template < class > class ICPTDisturber >
template < class >
class ICPTGenerator,
template < class >
class ICPTDisturber >
INLINE
MaxParentsMCBayesNetGenerator< GUM_SCALAR, ICPTGenerator, ICPTDisturber >::
MaxParentsMCBayesNetGenerator(Size nbrNodes,
......@@ -58,8 +60,10 @@ namespace gum {
}
template < typename GUM_SCALAR,
template < class > class ICPTGenerator,
template < class > class ICPTDisturber >
template < class >
class ICPTGenerator,
template < class >
class ICPTDisturber >
INLINE
MaxParentsMCBayesNetGenerator< GUM_SCALAR, ICPTGenerator, ICPTDisturber >::
MaxParentsMCBayesNetGenerator(BayesNet< GUM_SCALAR > bayesNet,
......@@ -74,8 +78,10 @@ namespace gum {
// Destructor.
template < typename GUM_SCALAR,
template < class > class ICPTGenerator,
template < class > class ICPTDisturber >
template < class >
class ICPTGenerator,
template < class >
class ICPTDisturber >
INLINE
MaxParentsMCBayesNetGenerator< GUM_SCALAR, ICPTGenerator, ICPTDisturber >::
~MaxParentsMCBayesNetGenerator() {
......@@ -83,8 +89,10 @@ namespace gum {
}
template < typename GUM_SCALAR,
template < class > class ICPTGenerator,
template < class > class ICPTDisturber >
template < class >
class ICPTGenerator,
template < class >
class ICPTDisturber >
bool MaxParentsMCBayesNetGenerator< GUM_SCALAR, ICPTGenerator, ICPTDisturber >::
__checkConditions() {
for (auto node : this->_bayesNet.nodes())
......@@ -94,16 +102,20 @@ namespace gum {
}
template < typename GUM_SCALAR,
template < class > class ICPTGenerator,
template < class > class ICPTDisturber >
template < class >
class ICPTGenerator,
template < class >
class ICPTDisturber >
INLINE Size MaxParentsMCBayesNetGenerator< GUM_SCALAR,
ICPTGenerator,
ICPTDisturber >::maxParents() const {
return _maxParents;
}
template < typename GUM_SCALAR,
template < class > class ICPTGenerator,
template < class > class ICPTDisturber >
template < class >
class ICPTGenerator,
template < class >
class ICPTDisturber >
INLINE void
MaxParentsMCBayesNetGenerator< GUM_SCALAR, ICPTGenerator, ICPTDisturber >::
setMaxParents(Size maxParents) {
......
......@@ -780,7 +780,8 @@ namespace gum {
/// default constructor
template < template < typename > class VARALLOC,
template < typename > class MISSALLOC >
template < typename >
class MISSALLOC >
IDatabaseTable(
const MissingValType< MISSALLOC >& missing_symbols,
const std::vector< std::string, VARALLOC< std::string > >& var_names,
......
......@@ -494,7 +494,8 @@ namespace gum {
// default constructor
template < typename T_DATA, template < typename > class ALLOC >
template < template < typename > class VARALLOC,
template < typename > class MISSALLOC >
template < typename >
class MISSALLOC >
IDatabaseTable< T_DATA, ALLOC >::IDatabaseTable(
const typename IDatabaseTable< T_DATA, ALLOC >::template MissingValType<
MISSALLOC >& missing_symbols,
......
......@@ -157,7 +157,8 @@ namespace gum {
/// default constructor
template < template < typename > class VARALLOC,
template < typename > class MISSALLOC >
template < typename >
class MISSALLOC >
RawDatabaseTable(
const MissingValType< MISSALLOC >& missing_symbols,
const std::vector< std::string, VARALLOC< std::string > >& var_names,
......
......@@ -34,7 +34,8 @@ namespace gum {
// default constructor
template < template < typename > class ALLOC >
template < template < typename > class VARALLOC,
template < typename > class MISSALLOC >
template < typename >
class MISSALLOC >
INLINE RawDatabaseTable< ALLOC >::RawDatabaseTable(
const typename RawDatabaseTable< ALLOC >::template MissingValType<
MISSALLOC >& missing_symbols,
......
......@@ -46,7 +46,8 @@ namespace gum {
*/
// clang-format on
template < typename GUM_SCALAR,
template < typename > class FUNCTOR,
template < typename >
class FUNCTOR,
template < typename > class TerminalNodePolicy =
ExactTerminalNodePolicy >
class MultiDimFunctionGraphOperator {
......
......@@ -30,8 +30,10 @@
namespace gum {
template < typename GUM_SCALAR,
template < typename > class FUNCTOR,
template < typename > class TerminalNodePolicy >
template < typename >
class FUNCTOR,
template < typename >
class TerminalNodePolicy >
MultiDimFunctionGraphOperator< GUM_SCALAR, FUNCTOR, TerminalNodePolicy >::
MultiDimFunctionGraphOperator(
const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy >* DG1,
......@@ -53,8 +55,10 @@ namespace gum {
}
template < typename GUM_SCALAR,
template < typename > class FUNCTOR,
template < typename > class TerminalNodePolicy >
template < typename >
class FUNCTOR,
template < typename >
class TerminalNodePolicy >
MultiDimFunctionGraphOperator< GUM_SCALAR, FUNCTOR, TerminalNodePolicy >::
~MultiDimFunctionGraphOperator() {
GUM_DESTRUCTOR(MultiDimFunctionGraphOperator);
......@@ -77,8 +81,10 @@ namespace gum {
// This function is the main function. To be call every time an operation
// between the two given Function Graphs is required
template < typename GUM_SCALAR,
template < typename > class FUNCTOR,
template < typename > class TerminalNodePolicy >
template < typename >
class FUNCTOR,
template < typename >
class TerminalNodePolicy >
MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy >*
MultiDimFunctionGraphOperator< GUM_SCALAR, FUNCTOR, TerminalNodePolicy >::
compute() {
......@@ -108,8 +114,10 @@ namespace gum {
// This function computes an efficient order for the final decision diagrams.
// Its main criterion to do so is the number of re-exploration to be done.
template < typename GUM_SCALAR,
template < typename > class FUNCTOR,
template < typename > class TerminalNodePolicy >
template < typename >
class FUNCTOR,
template < typename >
class TerminalNodePolicy >
void MultiDimFunctionGraphOperator< GUM_SCALAR, FUNCTOR, TerminalNodePolicy >::
__establishVarOrder() {
SequenceIteratorSafe< const DiscreteVariable* > fite =
......@@ -203,8 +211,10 @@ namespace gum {
// This function computes the number of re-exploration needed whenever to
// retrograde variables collides
template < typename GUM_SCALAR,
template < typename > class FUNCTOR,
template < typename > class TerminalNodePolicy >
template < typename >
class FUNCTOR,
template < typename >
class TerminalNodePolicy >
INLINE Idx
MultiDimFunctionGraphOperator< GUM_SCALAR, FUNCTOR, TerminalNodePolicy >::
__distance(const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy >* d,
......@@ -225,8 +235,10 @@ namespace gum {
// This function computes for every nodes if any retrograde variable is
// present below
template < typename GUM_SCALAR,
template < typename > class FUNCTOR,
template < typename > class TerminalNodePolicy >
template < typename >
class FUNCTOR,
template < typename >
class TerminalNodePolicy >
INLINE void
MultiDimFunctionGraphOperator< GUM_SCALAR, FUNCTOR, TerminalNodePolicy >::
__findRetrogradeVariables(
......@@ -322,8 +334,10 @@ namespace gum {
// algorithm ( meaning each time we explore a node we go trought
// this function ), check only have to be at the beginning of that function.
template < typename GUM_SCALAR,
template < typename > class FUNCTOR,
template < typename > class TerminalNodePolicy >
template < typename >
class FUNCTOR,
template < typename >
class TerminalNodePolicy >
NodeId MultiDimFunctionGraphOperator< GUM_SCALAR, FUNCTOR, TerminalNodePolicy >::
__compute(O4DGContext& currentSituation, Idx lastInstVarPos) {
__nbCall += 1;
......@@ -534,8 +548,10 @@ namespace gum {
}
template < typename GUM_SCALAR,
template < typename > class FUNCTOR,
template < typename > class TerminalNodePolicy >
template < typename >
class FUNCTOR,
template < typename >
class TerminalNodePolicy >
INLINE Idx MultiDimFunctionGraphOperator< GUM_SCALAR,
FUNCTOR,
TerminalNodePolicy >::nbCall() {
......@@ -543,8 +559,10 @@ namespace gum {
}
template < typename GUM_SCALAR,
template < typename > class FUNCTOR,
template < typename > class TerminalNodePolicy >
template < typename >
class FUNCTOR,
template < typename >
class TerminalNodePolicy >
INLINE Idx MultiDimFunctionGraphOperator< GUM_SCALAR,
FUNCTOR,
TerminalNodePolicy >::nbVarRetro() {
......@@ -552,8 +570,10 @@ namespace gum {
}
template < typename GUM_SCALAR,
template < typename > class FUNCTOR,
template < typename > class TerminalNodePolicy >
template < typename >
class FUNCTOR,
template < typename >
class TerminalNodePolicy >
INLINE Idx
MultiDimFunctionGraphOperator< GUM_SCALAR, FUNCTOR, TerminalNodePolicy >::
sizeVarRetroDomain() {
......
......@@ -45,7 +45,8 @@ namespace gum {
*/
// clang-format on
template < typename GUM_SCALAR,
template < typename > class FUNCTOR,
template < typename >
class FUNCTOR,
template < typename > class TerminalNodePolicy =
ExactTerminalNodePolicy >
class MultiDimFunctionGraphProjector {
......
......@@ -33,8 +33,10 @@ namespace gum {
// CONSTRUCTOR
template < typename GUM_SCALAR,
template < typename > class FUNCTOR,
template < typename > class TerminalNodePolicy >
template < typename >
class FUNCTOR,
template < typename >
class TerminalNodePolicy >
MultiDimFunctionGraphProjector< GUM_SCALAR, FUNCTOR, TerminalNodePolicy >::
MultiDimFunctionGraphProjector(
const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy >* src,
......@@ -49,8 +51,10 @@ namespace gum {
// DESTRUCTOR
template < typename GUM_SCALAR,
template < typename > class FUNCTOR,
template < typename > class TerminalNodePolicy >
template < typename >
class FUNCTOR,
template < typename >
class TerminalNodePolicy >
MultiDimFunctionGraphProjector< GUM_SCALAR, FUNCTOR, TerminalNodePolicy >::
~MultiDimFunctionGraphProjector() {
GUM_DESTRUCTOR(MultiDimFunctionGraphProjector);
......@@ -60,8 +64,10 @@ namespace gum {
// This function is the main function. To be call every time an Projection
// between the two given Function Graphs is required
template < typename GUM_SCALAR,
template < typename > class FUNCTOR,
template < typename > class TerminalNodePolicy >
template < typename >
class FUNCTOR,
template < typename >
class TerminalNodePolicy >
MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy >*
MultiDimFunctionGraphProjector< GUM_SCALAR, FUNCTOR, TerminalNodePolicy >::
project() {
......
......@@ -42,8 +42,10 @@ namespace gum {
* @ingroup multidim_group
*/
template < typename GUM_SCALAR,
template < typename > class COMBINEOPERATOR,
template < typename > class PROJECTOPERATOR,
template < typename >
class COMBINEOPERATOR,
template < typename >
class PROJECTOPERATOR,
template < typename > class TerminalNodePolicy =
ExactTerminalNodePolicy >
class Regress {
......
......@@ -34,9 +34,12 @@
namespace gum {
template < typename GUM_SCALAR,
template < typename > class COMBINEOPERATOR,
template < typename > class PROJECTOPERATOR,
template < typename > class TerminalNodePolicy >
template < typename >
class COMBINEOPERATOR,
template < typename >
class PROJECTOPERATOR,
template < typename >
class TerminalNodePolicy >
INLINE
Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::
Regress(const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy >* DG1,
......@@ -59,9 +62,12 @@ namespace gum {
}
template < typename GUM_SCALAR,
template < typename > class COMBINEOPERATOR,
template < typename > class PROJECTOPERATOR,
template < typename > class TerminalNodePolicy >
template < typename >
class COMBINEOPERATOR,
template < typename >
class PROJECTOPERATOR,
template < typename >
class TerminalNodePolicy >
INLINE
Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::
~Regress() {
......@@ -84,9 +90,12 @@ namespace gum {
// This function is the main function. To be call every time an operation
// between the two given Function Graphs is required
template < typename GUM_SCALAR,
template < typename > class COMBINEOPERATOR,
template < typename > class PROJECTOPERATOR,
template < typename > class TerminalNodePolicy >
template < typename >
class COMBINEOPERATOR,
template < typename >
class PROJECTOPERATOR,
template < typename >
class TerminalNodePolicy >
INLINE MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy >*
Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::
compute() {
......@@ -119,9 +128,12 @@ namespace gum {
// Its main criterion to do so is the number of
// re-exploration to be done
template < typename GUM_SCALAR,
template < typename > class COMBINEOPERATOR,
template < typename > class PROJECTOPERATOR,
template < typename > class TerminalNodePolicy >
template < typename >
class COMBINEOPERATOR,
template < typename >
class PROJECTOPERATOR,
template < typename >
class TerminalNodePolicy >
INLINE void
Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::
__establishVarOrder() {
......@@ -204,9 +216,12 @@ namespace gum {
// This function computes for every nodes if any retrograde variable is
// present below
template < typename GUM_SCALAR,
template < typename > class COMBINEOPERATOR,
template < typename > class PROJECTOPERATOR,
template < typename > class TerminalNodePolicy >
template < typename >
class COMBINEOPERATOR,
template < typename >
class PROJECTOPERATOR,
template < typename >
class TerminalNodePolicy >
INLINE void
Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::
__findRetrogradeVariables(
......@@ -299,9 +314,12 @@ namespace gum {
// algorithm ( meaning each time we explore a node we go trought
// this function ), check only have to be at the beginning of that function.
template < typename GUM_SCALAR,
template < typename > class COMBINEOPERATOR,
template < typename > class PROJECTOPERATOR,
template < typename > class TerminalNodePolicy >
template < typename >
class COMBINEOPERATOR,
template < typename >
class PROJECTOPERATOR,
template < typename >
class TerminalNodePolicy >
INLINE NodeId
Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::
__compute(O4DGContext& currentSituation, Idx lastInstVarPos) {
......
......@@ -43,7 +43,8 @@ namespace gum {
* @brief Class used to perform Decision Tree Operation in the FMDP Framework
*/
template < typename GUM_SCALAR,
template < typename > class COMBINEOPERATOR,
template < typename >
class COMBINEOPERATOR,
template < typename > class TerminalNodePolicy =
ExactTerminalNodePolicy >
class TreeOperator {
......
......@@ -34,8 +34,10 @@
namespace gum {
template < typename GUM_SCALAR,
template < typename > class COMBINEOPERATOR,
template < typename > class TerminalNodePolicy >
template < typename >
class COMBINEOPERATOR,
template < typename >
class TerminalNodePolicy >
INLINE
TreeOperator< GUM_SCALAR, COMBINEOPERATOR, TerminalNodePolicy >::TreeOperator(
const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy >* dt1,
......@@ -49,8 +51,10 @@ namespace gum {
}
template < typename GUM_SCALAR,
template < typename > class COMBINEOPERATOR,
template < typename > class TerminalNodePolicy >
template < typename >
class COMBINEOPERATOR,
template < typename >
class TerminalNodePolicy >
INLINE
TreeOperator< GUM_SCALAR, COMBINEOPERATOR, TerminalNodePolicy >::TreeOperator(
const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy >* dt1,
......@@ -65,8 +69,10 @@ namespace gum {
}
template < typename GUM_SCALAR,
template < typename > class COMBINEOPERATOR,
template < typename > class TerminalNodePolicy >
template < typename >
class COMBINEOPERATOR,
template < typename >
class TerminalNodePolicy >
INLINE TreeOperator< GUM_SCALAR, COMBINEOPERATOR, TerminalNodePolicy >::
~TreeOperator() {
GUM_DESTRUCTOR(TreeOperator);
......@@ -75,8 +81,10 @@ namespace gum {
// This function is the main function. To be call every time an operation
// between the two given Function Graphs is required
template < typename GUM_SCALAR,
template < typename > class COMBINEOPERATOR,
template < typename > class TerminalNodePolicy >
template < typename >
class COMBINEOPERATOR,
template < typename >
class TerminalNodePolicy >
INLINE MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy >*
TreeOperator< GUM_SCALAR, COMBINEOPERATOR, TerminalNodePolicy >::compute() {
__rd->manager()->setRootNode(__xPloreDT1(__dt1->root()));
......@@ -87,8 +95,10 @@ namespace gum {
// Main recursion function, called every time we move on a node to determine
// what we have to do
template < typename GUM_SCALAR,
template < typename > class COMBINEOPERATOR,
template < typename > class TerminalNodePolicy >
template < typename >
class COMBINEOPERATOR,
template < typename >
class TerminalNodePolicy >
INLINE NodeId
TreeOperator< GUM_SCALAR, COMBINEOPERATOR, TerminalNodePolicy >::__xPloreDT1(
NodeId currentNodeId) {
......@@ -113,8 +123,10 @@ namespace gum {
}
template < typename GUM_SCALAR,
template < typename > class COMBINEOPERATOR,
template < typename > class TerminalNodePolicy >
template < typename >
class COMBINEOPERATOR,
template < typename >
class TerminalNodePolicy >
INLINE NodeId
TreeOperator< GUM_SCALAR, COMBINEOPERATOR, TerminalNodePolicy >::__xPloreDT2(
NodeId currentNodeId) {
......@@ -141,8 +153,10 @@ namespace gum {
}
template < typename GUM_SCALAR,
template < typename > class COMBINEOPERATOR,
template < typename > class TerminalNodePolicy >
template < typename >
class COMBINEOPERATOR,
template < typename >
class TerminalNodePolicy >
INLINE NodeId TreeOperator< GUM_SCALAR, COMBINEOPERATOR, TerminalNodePolicy >::
__checkRedundancy(const DiscreteVariable* var, NodeId* sonsMap) {
bool diff = false;
......
......@@ -43,8 +43,10 @@ namespace gum {
* @brief Class used to perform Decision Tree Regression in the FMDP Framework
*/
template < typename GUM_SCALAR,
template < typename > class COMBINEOPERATOR,
template < typename > class PROJECTOPERATOR,
template < typename >
class COMBINEOPERATOR,
template < typename >
class PROJECTOPERATOR,
template < typename > class TerminalNodePolicy =
ExactTerminalNodePolicy >
class TreeRegress {
......
......@@ -35,9 +35,12 @@
namespace gum {
template < typename GUM_SCALAR,
template < typename > class COMBINEOPERATOR,
template < typename > class PROJECTOPERATOR,
template < typename > class TerminalNodePolicy >
template < typename >
class COMBINEOPERATOR,
template < typename >
class PROJECTOPERATOR,
template < typename >
class TerminalNodePolicy >
TreeRegress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::
TreeRegress(
const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy >* qAction,
......@@ -50,9 +53,12 @@ namespace gum {
}
template < typename GUM_SCALAR,
template < typename > class COMBINEOPERATOR,
template < typename > class PROJECTOPERATOR,
template < typename > class TerminalNodePolicy >
template < typename >
class COMBINEOPERATOR,
template < typename >
class PROJECTOPERATOR,
template < typename >
class TerminalNodePolicy >
TreeRegress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::
~TreeRegress() {
GUM_DESTRUCTOR(TreeRegress);
......@@ -61,9 +67,12 @@ namespace gum {
// This function is the main function. To be call every time an operation
// between the two given Function Graphs is required
template < typename GUM_SCALAR,
template < typename > class COMBINEOPERATOR,
template < typename > class PROJECTOPERATOR,
template < typename > class TerminalNodePolicy >
template < typename >
class COMBINEOPERATOR,
template < typename >
class PROJECTOPERATOR,
template < typename >
class TerminalNodePolicy >
MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy >*
TreeRegress< GUM_SCALAR,
COMBINEOPERATOR,
......@@ -81,9 +90,12 @@ namespace gum {
template < typename GUM_SCALAR,
template < typename > class COMBINEOPERATOR,
template < typename > class PROJECTOPERATOR,
template < typename > class TerminalNodePolicy >
template < typename >
class COMBINEOPERATOR,
template < typename >
class PROJECTOPERATOR,
template < typename >
class TerminalNodePolicy >
MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy >*
TreeRegress< GUM_SCALAR,
COMBINEOPERATOR,
......
......@@ -55,6 +55,26 @@ gum.NotFound
If the clique does not belong to the clique graph
"
%feature("docstring") gum::CliqueGraph::separator
"
Parameters
----------
clique1 : int
one extremity of the edge
clique : int
the other extremity of the edge
Returns
-------
Set