IMP::domino::JunctionTree Class Reference

Detailed Description

Stores a junction tree.

Note:: A junction tree T of an arbitrary graph G is a tree decomposition that has these three properties: 1. singly connected: there is exactly one path between each pair of subsets. 2. covering: for each clique A of G there is some subset C such that A ⊆ C. 3. running intersection: for each pair of clusters B and C that contain i, each cluster on the unique path between B and C also contains i. Further reading: Jordan (1999) Learning in graphical models


Public Types
typedef boost::adjacency_list < boost::vecS, boost::vecS, boost::undirectedS >	Graph
Public Member Functions
void	add_component_to_node (int vi, const std::string &name)
void	add_edge (int v1, int v2)
const std::string	get_component_name (int vi, int ci) const
	Get the name of a component.
const Graph *	get_graph () const
int	get_number_of_components (int vi) const
int	get_number_of_nodes () const
bool	has_edge (int n1, int n2) const
	JunctionTree (int number_of_nodes)
void	set_component_name (int vi, int ci, const std::string &name)
	Set the name of a component.
void	set_node_name (int vi, const std::string &name)
void	set_nodes (int number_of_nodes)
	Initialize a graph with N nodes.
void	show (std::ostream &out=std::cout) const
Protected Types
typedef std::vector < std::vector< std::string > >	NodeData
Protected Attributes
NodeData	data_
Graph	g_

const std::string IMP::domino::JunctionTree::get_component_name	(	int	vi,
		int	ci
	)			const

Get the name of a component.

Parameters:

`[in]`	vi	the node index
`[in]`	ci	the component index inside the node

void IMP::domino::JunctionTree::set_component_name	(	int	vi,
		int	ci,
		const std::string &	name
	)

Set the name of a component.

Parameters:

`[in]`	vi	the node index
`[in]`	ci	the component index inside the node
`[in]`	name	the name of the node

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