![]() |
Quantum Fog
0.9.3
|


Public Member Functions | |
| def | __init__ (self, id_num, subnodes) |
| def | add_sepset (self, sepset) |
| def | set_pot_to_one (self, is_quantum) |
| def | contains (self, nd_set) |
Public Member Functions inherited from nodes.Node.Node | |
| def | __init__ (self, id_num, name="blank") |
| def | __lt__ (self, other) |
| def | add_neighbor (self, node) |
| def | remove_neighbor (self, node) |
| def | has_neighbor (self, node) |
Public Attributes | |
| subnodes | |
| sepsets | |
| potential | |
Public Attributes inherited from nodes.Node.Node | |
| id_num | |
| topo_index | |
| name | |
| neighbors | |
| visited | |
Clique inherits from Node. Cliques are clusters of subnodes. Each clique
acts as a single node of a JoinTree. A JoinTree is an undirected graph
whereas a BayesNet is a directed one.
Attributes
----------
potential : Potential
sepsets : set[Sepset]
insert into this set one sepset for each
clique adjacent to the self clique.
subnodes : set[BayesNode]
id_num : int
topo_index : int
name : str
neighbors : set[Node]
visited : bool | def graphs.Clique.Clique.__init__ | ( | self, | |
| id_num, | |||
| subnodes | |||
| ) |
Constructor. Note that a clique is a Node that contains subnodes.
Make the name of self the concatenation of the names of its subnodes
in alphabetical order.
Parameters
----------
id_num : int
Unique int to identify each clique.
subnodes : set[Node]
Returns
-------
| def graphs.Clique.Clique.add_sepset | ( | self, | |
| sepset | |||
| ) |
Add sepset. Parameters ---------- sepset : Sepset Returns ------- None
| def graphs.Clique.Clique.contains | ( | self, | |
| nd_set | |||
| ) |
Checks if set self.subnodes contains nd_set. Parameters ---------- nd_set : set[Node] Returns ------- bool
| def graphs.Clique.Clique.set_pot_to_one | ( | self, | |
| is_quantum | |||
| ) |
Set potential to one.
Parameters
----------
is_quantum : bool
False->CBnet, True->QBnet
Returns
-------
None
1.8.11