include/dai/clustergraph.h File Reference

Defines class ClusterGraph, which is used by JTree, TreeEP and HAK. More...

#include <set>
#include <vector>
#include <dai/varset.h>
#include <dai/bipgraph.h>
#include <dai/factorgraph.h>

Go to the source code of this file.

Namespaces

namespace  dai

Classes

class  dai::ClusterGraph
 A ClusterGraph is a hypergraph with variables as nodes, and "clusters" (sets of variables) as hyperedges. More...
class  dai::sequentialVariableElimination
 Helper object for dai::ClusterGraph::VarElim(). More...
class  dai::greedyVariableElimination
 Helper object for dai::ClusterGraph::VarElim(). More...

Functions

size_t dai::eliminationCost_MinNeighbors (const ClusterGraph &cl, size_t i)
 Calculates cost of eliminating the i 'th variable from cluster graph cl according to the "MinNeighbors" criterion.
size_t dai::eliminationCost_MinWeight (const ClusterGraph &cl, size_t i)
 Calculates cost of eliminating the i 'th variable from cluster graph cl according to the "MinWeight" criterion.
size_t dai::eliminationCost_MinFill (const ClusterGraph &cl, size_t i)
 Calculates cost of eliminating the i 'th variable from cluster graph cl according to the "MinFill" criterion.
size_t dai::eliminationCost_WeightedMinFill (const ClusterGraph &cl, size_t i)
 Calculates cost of eliminating the i 'th variable from cluster graph cl according to the "WeightedMinFill" criterion.


Detailed Description

Defines class ClusterGraph, which is used by JTree, TreeEP and HAK.

Todo:
The "MinFill" and "WeightedMinFill" variable elimination heuristics seem designed for Markov graphs; add similar heuristics which are designed for factor graphs.

Generated on Thu Aug 5 19:04:01 2010 for libDAI by  doxygen 1.5.5