class CBNSGraph

This class is defined to create a Junction tree from the network

Public Fields

static int

m_nCounter This variable is used to check for the memory leak in the program

Public

	Construtors and Destructor CBNSGraph () Default Constuctor CBNSGraph (CBNSNetwork *pNetwork) Constructor with a pointer to the network ~CBNSGraph () Destructor
	Out Functions CBNSSet <CBNSClique*> GetCliqueSet () Returns the set of cliques generated by Minimum Degree Algorithm<\b> CBNSSet <CBNSSeparator*> GetSeparatorSet () Returns the set of separators generated by Minimum Degree Algorithm<\b> CBNSSet <CBNSCharge*> GetChargeSet () Returns the set of charges generated by Minimum degree algorithm<\b>
	Utility Functions void Init () Initializes the Graph, Ranks the nodes in the network void RankNodes () Ranks the nodes in the network based on some heuristics void MoralizeGraph (eBNSMoralizationMethod method = MORALIZATION_DEFAULT) Moralizes the Network by creating links between unconnected parents void TriangulateGraph (eBNSTriangulationMethod method = TRIANGULATION_DEFAULT) Triangulates the Network, this function needs further implementation as the methods such as minimum fill, minimum weight etc are not implemented <\em> bool DefaultTraingulationMethod () Default Triangulation method returns true if the network is triangulated bool DefaultMoralizationMethod () Default Moralization Method returns true if the network is moralized void MinDegreeAlgo () Minimum Degree Algorithm for obtaining the cliques and separators void CreateCliques () Create Cliques for the Network void RemoveLocalLinks () Deletes the temporary links generated by moralization and triangulation methods void CreateSeparators () Creates Separators void AssignProbNodes () Assigns probability nodes to the cliques bool IsMoralized () Returns true if the network is moralized bool IsTriangulated () Returns true if the network is triangulated bool SeparatorExists (CBNSClique* pClique1, CBNSClique* pClique2) Returns true if a separator already exists for pClique1 and pClique2

Private

Private Member Variables bool m_bMoralized This variable is true if the network is moralized bool m_bTriangulated This variable is true if the network is triangulated CBNSNetwork* m_pNetwork Pointer to the Network CBNSSet <CBNSLink *> m_pMoralLinks Set of Moralization Links CBNSSet <CBNSLink *> m_pTriangLinks Set of Triangulation Links CBNSSet <CBNSClique *> m_pCliqueSet Set of Cliques CBNSSet <CBNSSeparator *> m_pSeparatorSet Set of Separators CBNSSet <CBNSCharge *> m_pChargeSet Set of Charges

static int m_nCounter

This variable is used to check for the memory leak in the program

Construtors and Destructor

CBNSGraph()

Default Constuctor

CBNSGraph(CBNSNetwork *pNetwork)

Constructor with a pointer to the network

Parameters:

pNetwork - a pointer to the CBNSNetwork

~CBNSGraph()

Destructor

Out Functions

CBNSSet <CBNSClique*> GetCliqueSet()

Returns the set of cliques generated by Minimum Degree Algorithm<\b>

Returns:

CBNSSet

CBNSSet <CBNSSeparator*> GetSeparatorSet()

Returns the set of separators generated by Minimum Degree Algorithm<\b>

Returns:

CBNSSet

CBNSSet <CBNSCharge*> GetChargeSet()

Returns the set of charges generated by Minimum degree algorithm<\b>

Returns:

CBNSSet

Utility Functions

void Init()

Initializes the Graph, Ranks the nodes in the network. Minimum degree algorithm is used in the initialization of the graph and this needs to be changed later on<\it>

void RankNodes()

Ranks the nodes in the network based on some heuristics

void MoralizeGraph(eBNSMoralizationMethod method = MORALIZATION_DEFAULT)

Moralizes the Network by creating links between unconnected parents

void TriangulateGraph(eBNSTriangulationMethod method = TRIANGULATION_DEFAULT)

Triangulates the Network, this function needs further implementation as the methods such as minimum fill, minimum weight etc are not implemented <\em>

bool DefaultTraingulationMethod()

Default Triangulation method returns true if the network is triangulated

Returns:

bool

bool DefaultMoralizationMethod()

Default Moralization Method returns true if the network is moralized

Returns:

bool

void MinDegreeAlgo()

Minimum Degree Algorithm for obtaining the cliques and separators

void CreateCliques()

Create Cliques for the Network

void RemoveLocalLinks()

Deletes the temporary links generated by moralization and triangulation methods

void CreateSeparators()

Creates Separators

void AssignProbNodes()

Assigns probability nodes to the cliques

bool IsMoralized()

Returns true if the network is moralized

Returns:

bool

bool IsTriangulated()

Returns true if the network is triangulated

Returns:

bool

bool SeparatorExists(CBNSClique* pClique1, CBNSClique* pClique2)

Returns true if a separator already exists for pClique1 and pClique2

Returns:

bool

Parameters:

pClique1 - a pointer to CBNSClique object
pClique2 - a pointer to CBNSClique object

Private Member Variables

bool m_bMoralized

This variable is true if the network is moralized

bool m_bTriangulated

This variable is true if the network is triangulated

CBNSNetwork* m_pNetwork

Pointer to the Network

CBNSSet <CBNSLink *> m_pMoralLinks

Set of Moralization Links

CBNSSet <CBNSLink *> m_pTriangLinks

Set of Triangulation Links

CBNSSet <CBNSClique *> m_pCliqueSet

Set of Cliques

CBNSSet <CBNSSeparator *> m_pSeparatorSet

Set of Separators

CBNSSet <CBNSCharge *> m_pChargeSet

Set of Charges

---

This class has no child classes.

alphabetic index hierarchy of classes

---

this page has been generated automatically by doc++

(c)opyright by Malte Zöckler, Roland Wunderling
contact: doc++@zib.de