 |
Quantum Fog
0.9.3
|
Public Member Functions | |
| def | __init__ (self, mo_graph, do_print=False) |
| def | refresh_star_heap (self, pop_star) |
| def | describe_yourself (self) |
 Public Member Functions inherited from graphs.Graph.Graph | |
| def | __init__ (self, nodes) |
| def | add_nodes (self, nodes) |
| def | has_node (self, node) |
| def | contains (self, nodes) |
| def | unmark_all_nodes (self) |
| def | get_node_named (self, name) |
| def | get_node_with_id_num (self, id_num) |
| def | get_node_with_topo_index (self, topo_index) |
| def | get_nx_graph (self) |
| def | draw (self, algo_num, kwargs) |
| def | write_dot (self, path) |
| def | read_dot (cls, path) |
Static Public Member Functions | |
| def | preclique_is_maximal (clique_list, preclique) |
| Static Public Member Functions inherited from graphs.Graph.Graph | |
| def | new_from_nx_graph (nx_graph) |
Public Attributes | |
| star_heap | |
| cliques | |
| Public Attributes inherited from graphs.Graph.Graph | |
| nodes | |
A TriangulatedGraph is an undirected Graph that is constructed from a MoralGraph by adding additional edges to it. The new edges are added using a non-unique heuristic. Construction of the TriangulatedGraph yields a set of cliques of the original BayesNet that was used to construct the MoralGraph in the first place. These cliques are used to build a JoinTree which is needed by the JoinTreeEngine. Attributes ---------- cliques : list[Clique] star _heap : list[Star] nodes : set[Node]
| def graphs.TriangulatedGraph.TriangulatedGraph.__init__ | ( | self, | |
| mo_graph, | |||
do_print = False |
|||
| ) |
Constructor Parameters ---------- mo_graph : MoralGraph do_print : bool Returns -------
| def graphs.TriangulatedGraph.TriangulatedGraph.describe_yourself | ( | self | ) |
Print a pretty summary of the attributes of self. Returns -------
|
static |
Answer whether the set 'preclique' is contained in any of the cliques in 'clique_list'. Parameters ---------- clique_list : list[Clique] preclique : set[BayesNode] Returns ------- bool
| def graphs.TriangulatedGraph.TriangulatedGraph.refresh_star_heap | ( | self, | |
| pop_star | |||
| ) |
Remove pop_star.node from neighbor sets of all stars in star_heap Parameters ---------- pop_star : Star Returns ------- None
1.8.11
