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
|