aGrUM  0.20.2
a C++ library for (probabilistic) graphical models
gum::SimplicialSet Member List

This is the complete list of members for gum::SimplicialSet, including all inherited members.

addEdge(NodeId first, NodeId second)gum::SimplicialSet
allAlmostSimplicialNodes()gum::SimplicialSet
allQuasiSimplicialNodes()gum::SimplicialSet
allSimplicialNodes()gum::SimplicialSet
almost_simplicial_nodes__gum::SimplicialSetprivate
Belong__ enum namegum::SimplicialSetprivate
bestAlmostSimplicialNode()gum::SimplicialSet
bestQuasiSimplicialNode()gum::SimplicialSet
bestSimplicialNode()gum::SimplicialSet
changed_status__gum::SimplicialSetprivate
containing_list__gum::SimplicialSetprivate
eraseClique(const NodeId id)gum::SimplicialSet
eraseEdge(const Edge &edge)gum::SimplicialSet
eraseNode(const NodeId id)gum::SimplicialSet
fill_ins_list__gum::SimplicialSetprivate
fillIns() constgum::SimplicialSet
graph__gum::SimplicialSetprivate
hasAlmostSimplicialNode()gum::SimplicialSet
hasQuasiSimplicialNode()gum::SimplicialSet
hasSimplicialNode()gum::SimplicialSet
initialize__()gum::SimplicialSetprivate
isSimplicial(const NodeId id)gum::SimplicialSet
log_domain_sizes__gum::SimplicialSetprivate
log_threshold__gum::SimplicialSetprivate
log_tree_width__gum::SimplicialSetprivate
log_weights__gum::SimplicialSetprivate
makeClique(const NodeId id)gum::SimplicialSet
nb_adjacent_neighbours__gum::SimplicialSetprivate
nb_triangles__gum::SimplicialSetprivate
operator=(const SimplicialSet &)gum::SimplicialSetprivate
quasi_ratio__gum::SimplicialSetprivate
quasi_simplicial_nodes__gum::SimplicialSetprivate
replaceLogWeights(NodeProperty< double > *old_weigths, NodeProperty< double > *new_weights)gum::SimplicialSet
setFillIns(bool on_off)gum::SimplicialSet
setGraph(UndiGraph *graph, const NodeProperty< double > *log_domain_sizes, NodeProperty< double > *log_weights, double theRatio=GUM_QUASI_RATIO, double theThreshold=GUM_WEIGHT_THRESHOLD)gum::SimplicialSet
simplicial_nodes__gum::SimplicialSetprivate
SimplicialSet(UndiGraph *graph, const NodeProperty< double > *log_domain_sizes, NodeProperty< double > *log_weights, double theRatio=GUM_QUASI_RATIO, double theThreshold=GUM_WEIGHT_THRESHOLD)gum::SimplicialSetexplicit
SimplicialSet(const SimplicialSet &simplicial_from, UndiGraph *graph, const NodeProperty< double > *log_domain_sizes, NodeProperty< double > *log_weights, bool avoid_check=false)gum::SimplicialSet
SimplicialSet(SimplicialSet &&from)gum::SimplicialSet
SimplicialSet(const SimplicialSet &)gum::SimplicialSetprivate
updateAllNodes__()gum::SimplicialSetprivate
updateList__(const NodeId id)gum::SimplicialSetprivate
we_want_fill_ins__gum::SimplicialSetprivate
~SimplicialSet()gum::SimplicialSet