gum::UnconstrainedTriangulation Class Reference

Interface for all triangulation methods without constraints on node elimination orderings. More...

#include <unconstrainedTriangulation.h>

Inheritance diagram for gum::UnconstrainedTriangulation:

Collaboration diagram for gum::UnconstrainedTriangulation:

Public Member Functions
Accessors / Modifiers
virtual UnconstrainedTriangulation *	newFactory () const =0
	returns a fresh triangulation (over an empty graph) of the same type as the current object More...
virtual UnconstrainedTriangulation *	copyFactory () const =0
	virtual copy constructor More...
virtual	~UnconstrainedTriangulation ()
	destructor More...
Accessors / Modifiers
double	maxLog10CliqueDomainSize ()
	returns the max of log10DomainSize of the cliques in the junction tree. More...
const NodeProperty< Size > *	domainSizes () const
	returns the domain sizes of the variables of the graph to be triangulated More...

Protected Attributes
EliminationSequenceStrategy *	elimination_sequence_strategy_ {nullptr}
	the elimination sequence strategy used by the triangulation More...
JunctionTreeStrategy *	junction_tree_strategy_ {nullptr}
	the junction tree strategy used by the triangulation More...
const NodeProperty< Size > *	domain_sizes_ {nullptr}
	the domain sizes of the variables/nodes of the graph More...

Protected Member Functions
Constructors / Destructors
	UnconstrainedTriangulation (const UnconstrainedEliminationSequenceStrategy &elimSeq, const JunctionTreeStrategy &JTStrategy, bool minimality=false)
	default constructor More...
	UnconstrainedTriangulation (const UndiGraph *graph, const NodeProperty< Size > *dom, const UnconstrainedEliminationSequenceStrategy &elimSeq, const JunctionTreeStrategy &JTStrategy, bool minimality=false)
	constructor with a given graph More...
	UnconstrainedTriangulation (const UnconstrainedTriangulation &)
	forbid copy constructor except in newfactory More...
	UnconstrainedTriangulation (UnconstrainedTriangulation &&)
	forbid move constructor except in children's constructors More...

Accessors / Modifiers
virtual void	setGraph (const UndiGraph *graph, const NodeProperty< Size > *domsizes)
	initialize the triangulation data structures for a new graph More...
const EdgeSet &	fillIns ()
	returns the fill-ins added by the triangulation algorithm More...
const std::vector< NodeId > &	eliminationOrder ()
	returns an elimination ordering compatible with the triangulated graph More...
Idx	eliminationOrder (const NodeId)
	returns the index of a given node in the elimination order (0 = first node eliminated) More...
const NodeProperty< NodeId > &	reverseEliminationOrder ()
	returns a table indicating, for each node, at which step it was deleted by the triangulation process More...
const UndiGraph &	triangulatedGraph ()
	returns the triangulated graph More...
const CliqueGraph &	eliminationTree ()
	returns the elimination tree of a compatible ordering More...
const CliqueGraph &	junctionTree ()
	returns a compatible junction tree More...
NodeId	createdJunctionTreeClique (const NodeId id)
	returns the Id of the clique of the junction tree created by the elimination of a given node during the triangulation process More...
const NodeProperty< NodeId > &	createdJunctionTreeCliques ()
	returns the Ids of the cliques of the junction tree created by the elimination of the nodes More...
const CliqueGraph &	maxPrimeSubgraphTree ()
	returns a junction tree of maximal prime subgraphs More...
NodeId	createdMaxPrimeSubgraph (const NodeId id)
	returns the Id of the maximal prime subgraph created by the elimination of a given node during the triangulation process More...
void	clear ()
	reinitialize the graph to be triangulated to an empty graph More...
void	setMinimalRequirement (bool)
	sets/unset the minimality requirement More...
virtual bool	isMinimalityRequired () const final
	indicates wether minimality is required More...
void	setFillIns (bool)
	sets/unsets the record of the fill-ins in the standard triangulation procedure More...
const UndiGraph *	originalGraph () const
	returns the graph to be triangulated More...
EliminationSequenceStrategy &	eliminationSequenceStrategy () const
	returns the elimination sequence strategy used by the triangulation More...
JunctionTreeStrategy &	junctionTreeStrategy () const
	returns the junction tree strategy used by the triangulation More...
virtual void	initTriangulation_ (UndiGraph &graph)
	the function called to initialize the triangulation process More...

Detailed Description

Interface for all triangulation methods without constraints on node elimination orderings.

Definition at line 44 of file unconstrainedTriangulation.h.

Constructor & Destructor Documentation

~UnconstrainedTriangulation()

gum::UnconstrainedTriangulation::~UnconstrainedTriangulation ( )

virtual

destructor

Definition at line 74 of file unconstrainedTriangulation.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                          {
    // for debugging purposes
    GUM_DESTRUCTOR(UnconstrainedTriangulation);
  }

Here is the call graph for this function:

UnconstrainedTriangulation() [1/4]

gum::UnconstrainedTriangulation::UnconstrainedTriangulation ( const UnconstrainedEliminationSequenceStrategy &  elimSeq, const JunctionTreeStrategy &  JTStrategy, bool  minimality = false  )

protected

default constructor

Parameters

elimSeq	the elimination sequence used to triangulate the graph
JTStrategy	the junction tree strategy used to create junction trees
minimality	a Boolean indicating whether we should enforce that the triangulation is minimal w.r.t. inclusion

Definition at line 36 of file unconstrainedTriangulation.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                                 :
      StaticTriangulation(elimSeq, JTStrategy, minimality) {
    // for debugging purposes
    GUM_CONSTRUCTOR(UnconstrainedTriangulation);
  }

Here is the call graph for this function:

UnconstrainedTriangulation() [2/4]

gum::UnconstrainedTriangulation::UnconstrainedTriangulation ( const UndiGraph *  graph, const NodeProperty< Size > *  dom, const UnconstrainedEliminationSequenceStrategy &  elimSeq, const JunctionTreeStrategy &  JTStrategy, bool  minimality = false  )

protected

constructor with a given graph

Parameters

graph	the graph to be triangulated, i.e., the nodes of which will be eliminated
dom	the domain sizes of the nodes to be eliminated
elimSeq	the elimination sequence used to triangulate the graph
JTStrategy	the junction tree strategy used to create junction trees
minimality	a Boolean indicating whether we should enforce that the triangulation is minimal w.r.t. inclusion

Warning

note that, by aGrUM's rule, the graph and the modalities are not copied but only referenced by the elimination sequence algorithm.

Definition at line 46 of file unconstrainedTriangulation.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                                 :
      StaticTriangulation(theGraph, domsizes, elimSeq, JTStrategy, minimality) {
    // for debugging purposes
    GUM_CONSTRUCTOR(UnconstrainedTriangulation);
  }

Here is the call graph for this function:

UnconstrainedTriangulation() [3/4]

gum::UnconstrainedTriangulation::UnconstrainedTriangulation ( const UnconstrainedTriangulation &  from )

protected

forbid copy constructor except in newfactory

copy constructor

Definition at line 58 of file unconstrainedTriangulation.cpp.

References gum::Set< Key, Alloc >::emplace().

                                             :
      StaticTriangulation(from) {
    // for debugging purposes
    GUM_CONS_CPY(UnconstrainedTriangulation);
  }

Here is the call graph for this function:

UnconstrainedTriangulation() [4/4]

gum::UnconstrainedTriangulation::UnconstrainedTriangulation ( UnconstrainedTriangulation &&  from )

protected

forbid move constructor except in children's constructors

move constructor

Definition at line 66 of file unconstrainedTriangulation.cpp.

References gum::Set< Key, Alloc >::emplace().

                                        :
      StaticTriangulation(std::move(from)) {
    // for debugging purposes
    GUM_CONS_MOV(UnconstrainedTriangulation);
  }

Here is the call graph for this function:

Member Function Documentation

clear()

void gum::StaticTriangulation::clear ( )

virtualinherited

reinitialize the graph to be triangulated to an empty graph

Implements gum::Triangulation.

Definition at line 164 of file staticTriangulation.cpp.

References gum::Set< Key, Alloc >::emplace().

                                  {
    // clear the factories
    elimination_sequence_strategy_->clear();
    junction_tree_strategy_->clear();

    // remove the current graphs
    original_graph__ = nullptr;
    junction_tree__  = nullptr;
    triangulated_graph__.clear();
    elim_tree__.clear();
    max_prime_junction_tree__.clear();
    elim_cliques__.clear();
    node_2_max_prime_clique__.clear();

    // remove all fill-ins and orderings
    fill_ins__.clear();
    added_fill_ins__.clear();
    elim_order__.clear();
    reverse_elim_order__.clear();

    // indicates that the junction tree, the max prime tree, etc, are updated
    has_triangulation__           = true;
    has_triangulated_graph__      = true;
    has_elimination_tree__        = true;
    has_junction_tree__           = true;
    has_max_prime_junction_tree__ = true;
    has_fill_ins__                = true;
  }

Here is the call graph for this function:

copyFactory()

virtual UnconstrainedTriangulation* gum::UnconstrainedTriangulation::copyFactory ( ) const

pure virtual

virtual copy constructor

note that we return a pointer as it enables subclasses to return pointers to their types, not Triangulation pointers. See item 25 of the more effective C++.

Implements gum::StaticTriangulation.

Implemented in gum::DefaultTriangulation.

createdJunctionTreeClique()

NodeId gum::StaticTriangulation::createdJunctionTreeClique ( const NodeId  id )

virtualinherited

returns the Id of the clique of the junction tree created by the elimination of a given node during the triangulation process

Implements gum::Triangulation.

createdJunctionTreeCliques()

const NodeProperty< NodeId >& gum::StaticTriangulation::createdJunctionTreeCliques ( )

virtualinherited

returns the Ids of the cliques of the junction tree created by the elimination of the nodes

Implements gum::Triangulation.

createdMaxPrimeSubgraph()

NodeId gum::StaticTriangulation::createdMaxPrimeSubgraph ( const NodeId  id )

virtualinherited

returns the Id of the maximal prime subgraph created by the elimination of a given node during the triangulation process

Implements gum::Triangulation.

domainSizes()

const NodeProperty< Size >* gum::Triangulation::domainSizes ( ) const

inherited

returns the domain sizes of the variables of the graph to be triangulated

eliminationOrder() [1/2]

const std::vector< NodeId >& gum::StaticTriangulation::eliminationOrder ( )

virtualinherited

returns an elimination ordering compatible with the triangulated graph

Implements gum::Triangulation.

eliminationOrder() [2/2]

Idx gum::StaticTriangulation::eliminationOrder ( const NodeId  )

virtualinherited

returns the index of a given node in the elimination order (0 = first node eliminated)

Implements gum::Triangulation.

eliminationSequenceStrategy()

EliminationSequenceStrategy& gum::StaticTriangulation::eliminationSequenceStrategy ( ) const

inherited

returns the elimination sequence strategy used by the triangulation

eliminationTree()

const CliqueGraph& gum::StaticTriangulation::eliminationTree ( )

virtualinherited

returns the elimination tree of a compatible ordering

Implements gum::Triangulation.

fillIns()

const EdgeSet & gum::StaticTriangulation::fillIns ( )

virtualinherited

returns the fill-ins added by the triangulation algorithm

Implements gum::Triangulation.

Definition at line 679 of file staticTriangulation.cpp.

References gum::Set< Key, Alloc >::emplace().

                                              {
    // if we did not compute the triangulation yet, do it and commpute
    // the fill-ins at the same time
    if (!has_triangulation__) {
      bool want_fill_ins = we_want_fill_ins__;
      we_want_fill_ins__ = true;
      triangulate__();
      we_want_fill_ins__ = want_fill_ins;
      has_fill_ins__     = true;
    }

    // here, we already computed a triangulation and we already computed
    // the fill-ins, so return them
    if (has_fill_ins__) {
      if (elimination_sequence_strategy_->providesFillIns())
        return elimination_sequence_strategy_->fillIns();
      else
        return fill_ins__;
    } else {
      // ok, here, we shall compute the fill-ins as they were not precomputed
      if (!original_graph__) return fill_ins__;

      // just in case, be sure that the junction tree has been constructed
      if (!has_junction_tree__) junctionTree();

      for (const auto clik_id: junction_tree__->nodes()) {
        // for each clique, add the edges necessary to make it complete
        const NodeSet&        clique = junction_tree__->clique(clik_id);
        std::vector< NodeId > clique_nodes(clique.size());
        unsigned int          i = 0;

        for (const auto node: clique) {
          clique_nodes[i] = node;
          i += 1;
        }

        for (i = 0; i < clique_nodes.size(); ++i) {
          for (unsigned int j = i + 1; j < clique_nodes.size(); ++j) {
            Edge edge(clique_nodes[i], clique_nodes[j]);

            if (!original_graph__->existsEdge(edge)) {
              try {
                fill_ins__.insert(edge);
              } catch (DuplicateElement&) {}
            }
          }
        }
      }

      return fill_ins__;
    }
  }

Here is the call graph for this function:

initTriangulation_()

void gum::StaticTriangulation::initTriangulation_ ( UndiGraph &  graph )

protectedvirtualinherited

the function called to initialize the triangulation process

This function is called when the triangulation process starts and is used to initialize the elimination sequence strategy. Actually, the graph that is modified by the triangulation algorithm is a copy of the original graph, and this copy needs be known by the elimination sequence strategy. initTriangulation_ is used to transmit this knowledge to the elimination sequence (through method setGraph of the elimination sequence class).

Parameters

graph

the very graph that is triangulated (this is a copy of original_graph__)

Reimplemented in gum::PartialOrderedTriangulation, and gum::OrderedTriangulation.

Definition at line 733 of file staticTriangulation.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                               {
    elimination_sequence_strategy_->setGraph(&graph, domain_sizes_);
  }

Here is the call graph for this function:

isMinimalityRequired()

virtual bool gum::StaticTriangulation::isMinimalityRequired ( ) const

finalvirtualinherited

indicates wether minimality is required

junctionTree()

const CliqueGraph& gum::StaticTriangulation::junctionTree ( )

virtualinherited

returns a compatible junction tree

Implements gum::Triangulation.

junctionTreeStrategy()

JunctionTreeStrategy& gum::StaticTriangulation::junctionTreeStrategy ( ) const

inherited

returns the junction tree strategy used by the triangulation

maxLog10CliqueDomainSize()

double gum::Triangulation::maxLog10CliqueDomainSize ( )

inherited

returns the max of log10DomainSize of the cliques in the junction tree.

This is usefull for instance to estimate the complexity (both in space and in time) of the inference that will use the junction tree.

This method is not 'const' since it can be called before building any junction tree and hence it needs to build it...

Definition at line 69 of file triangulation.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                 {
    double              res = 0.0;
    double              dSize;
    const JunctionTree& jt = junctionTree();   // here, the fact that we get
    // a junction tree ensures that domain_sizes_ is different from nullptr

    for (const NodeId cl: jt) {
      dSize = 0.0;

      for (const auto node: jt.clique(cl))
        dSize += std::log10((*domain_sizes_)[node]);

      if (res < dSize) res = dSize;
    }

    return res;
  }

Here is the call graph for this function:

maxPrimeSubgraphTree()

const CliqueGraph& gum::StaticTriangulation::maxPrimeSubgraphTree ( )

virtualinherited

returns a junction tree of maximal prime subgraphs

Warning

Actually, the cliques of the junction tree are guarranteed to be maximal prime subgraph of the original graph that was triangulated only if the triangulation performed is minimal (in the sense that removing any edge in the triangulated graph results in a nontriangulated graph). This can be ensured by requiring minimality of the triangulation.

Implements gum::Triangulation.

newFactory()

virtual UnconstrainedTriangulation* gum::UnconstrainedTriangulation::newFactory ( ) const

pure virtual

returns a fresh triangulation (over an empty graph) of the same type as the current object

note that we return a pointer as it enables subclasses to return pointers to their types, not Triangulation pointers. See item 25 of the more effective C++.

Implements gum::StaticTriangulation.

Implemented in gum::DefaultTriangulation.

operator=()

UnconstrainedTriangulation& gum::UnconstrainedTriangulation::operator= ( const UnconstrainedTriangulation &  )

private

forbid copy operator

originalGraph()

const UndiGraph* gum::StaticTriangulation::originalGraph ( ) const

inherited

returns the graph to be triangulated

Warning

if we have not set yet a graph, then originalGraph () will return a nullptr.

reverseEliminationOrder()

const NodeProperty< NodeId >& gum::StaticTriangulation::reverseEliminationOrder ( )

inherited

returns a table indicating, for each node, at which step it was deleted by the triangulation process

setFillIns()

void gum::StaticTriangulation::setFillIns ( bool  )

inherited

sets/unsets the record of the fill-ins in the standard triangulation procedure

setGraph()

void gum::StaticTriangulation::setGraph ( const UndiGraph *  graph, const NodeProperty< Size > *  domsizes  )

virtualinherited

initialize the triangulation data structures for a new graph

Parameters

graph	the graph to be triangulated, i.e., the nodes of which will be eliminated
domsizes	the domain sizes of the nodes to be eliminated

Warning

Note that we allow domsizes to be defined over nodes/variables that do not belong to graph. These sizes will simply be ignored. However, it is compulsory that all the nodes of graph belong to dom_sizes

the graph is not copied but only referenced by the elimination sequence algorithm.

Implements gum::Triangulation.

Reimplemented in gum::PartialOrderedTriangulation, and gum::OrderedTriangulation.

Definition at line 526 of file staticTriangulation.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                                           {
    // remove the old graph
    clear();

    if (graph != nullptr) {
      // prepare the size of the data for the new graph
      elim_order__.resize(graph->size());
      reverse_elim_order__.resize(graph->size());
      elim_cliques__.resize(graph->size());
      added_fill_ins__.resize(graph->size());
      node_2_max_prime_clique__.resize(graph->size());
    }

    // keep track of the variables passed in argument
    original_graph__ = graph;
    domain_sizes_    = domsizes;

    // indicate that no triangulation was performed for this graph
    has_triangulation__           = false;
    has_triangulated_graph__      = false;
    has_elimination_tree__        = false;
    has_junction_tree__           = false;
    has_max_prime_junction_tree__ = false;
    has_fill_ins__                = false;
  }

Here is the call graph for this function:

setMinimalRequirement()

void gum::StaticTriangulation::setMinimalRequirement ( bool  )

inherited

sets/unset the minimality requirement

triangulatedGraph()

const UndiGraph & gum::StaticTriangulation::triangulatedGraph ( )

virtualinherited

returns the triangulated graph

Implements gum::Triangulation.

Definition at line 487 of file staticTriangulation.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                          {
    if (!has_triangulation__) triangulate__();

    // if we did not construct the triangulated graph during the triangulation,
    // that is, we just constructed the junction tree, we shall construct it now
    if (!has_triangulated_graph__) {
      // just in case, be sure that the junction tree has been constructed
      if (!has_junction_tree__) junctionTree();

      // copy the original graph
      triangulated_graph__ = *original_graph__;

      for (const auto clik_id: *junction_tree__) {
        // for each clique, add the edges necessary to make it complete
        const NodeSet&        clique = junction_tree__->clique(clik_id);
        std::vector< NodeId > clique_nodes(clique.size());
        unsigned int          i = 0;

        for (const auto node: clique) {
          clique_nodes[i] = node;
          i += 1;
        }

        for (i = 0; i < clique_nodes.size(); ++i) {
          for (unsigned int j = i + 1; j < clique_nodes.size(); ++j) {
            try {
              triangulated_graph__.addEdge(clique_nodes[i], clique_nodes[j]);
            } catch (DuplicateElement&) {}
          }
        }
      }

      has_triangulated_graph__ = true;
    }

    return triangulated_graph__;
  }

Here is the call graph for this function:

Member Data Documentation

domain_sizes_

const NodeProperty< Size >* gum::Triangulation::domain_sizes_ {nullptr}

protectedinherited

the domain sizes of the variables/nodes of the graph

Definition at line 152 of file triangulation.h.

elimination_sequence_strategy_

EliminationSequenceStrategy* gum::StaticTriangulation::elimination_sequence_strategy_ {nullptr}

protectedinherited

the elimination sequence strategy used by the triangulation

Definition at line 230 of file staticTriangulation.h.

junction_tree_strategy_

JunctionTreeStrategy* gum::StaticTriangulation::junction_tree_strategy_ {nullptr}

protectedinherited

the junction tree strategy used by the triangulation

Definition at line 233 of file staticTriangulation.h.

---

The documentation for this class was generated from the following files:

• agrum/tools/graphs/algorithms/triangulations/unconstrainedTriangulation.h
• agrum/tools/graphs/algorithms/triangulations/unconstrainedTriangulation.cpp