 |
Quantum Fog
0.9.3
|
Public Member Functions | |
| def | __init__ (self, id_num, name="blank") |
| def | add_parent (self, node) |
| def | add_parents (self, node_list) |
| def | remove_parent (self, node) |
| def | has_parent (self, node) |
| def | add_child (self, node) |
| def | add_children (self, node_list) |
| def | remove_child (self, node) |
| def | has_child (self, node) |
| def | undirect (self) |
| def | get_markov_blanket (self) |
 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 | |
| parents | |
| children | |
| neighbors | |
| Public Attributes inherited from nodes.Node.Node | |
| id_num | |
| topo_index | |
| name | |
| neighbors | |
| visited | |
A DirectedNode is a Node. Besides maintaining a list of neighbors, it maintains a list of parents and children. Attributes ---------- children : set[DirectedNode] neighbors : set[DirectedNode] parents : set[DirectedNode] id_num : int topo_index : int name : str visited : bool
| def nodes.DirectedNode.DirectedNode.__init__ | ( | self, | |
| id_num, | |||
name = "blank" |
|||
| ) |
Constructor Parameters ---------- id_num : int name : str Returns -------
| def nodes.DirectedNode.DirectedNode.add_child | ( | self, | |
| node | |||
| ) |
Add a child node. Parameters ---------- node : DirectedNode Returns ------- None
| def nodes.DirectedNode.DirectedNode.add_children | ( | self, | |
| node_list | |||
| ) |
Add children nodes from a list of them Parameters ---------- node_list : list(DirectedNode) Returns ------- None
| def nodes.DirectedNode.DirectedNode.add_parent | ( | self, | |
| node | |||
| ) |
Add a parent node. Parameters ---------- node : DirectedNode Returns ------- None
| def nodes.DirectedNode.DirectedNode.add_parents | ( | self, | |
| node_list | |||
| ) |
Add parent nodes from a list of them. Parameters ---------- node_list : list(DirectedNode) Returns ------- None
| def nodes.DirectedNode.DirectedNode.get_markov_blanket | ( | self | ) |
This returns a set called the Markov Blanket of a node, which includes the parents, children and children's parents of the node. Returns ------- set[DirectedNode]
| def nodes.DirectedNode.DirectedNode.has_child | ( | self, | |
| node | |||
| ) |
Returns answer to question of whether self has the given node as child. Parameters ---------- node : DirectedNode Returns ------- bool
| def nodes.DirectedNode.DirectedNode.has_parent | ( | self, | |
| node | |||
| ) |
Returns answer to question of whether self has the given node as parent. Parameters ---------- node : DirectedNode Returns ------- bool
| def nodes.DirectedNode.DirectedNode.remove_child | ( | self, | |
| node | |||
| ) |
Remove a child node. Parameters ---------- node : DirectedNode Returns ------- None
| def nodes.DirectedNode.DirectedNode.remove_parent | ( | self, | |
| node | |||
| ) |
Remove a parent node. Parameters ---------- node : DirectedNode Returns ------- None
| def nodes.DirectedNode.DirectedNode.undirect | ( | self | ) |
This makes neighbor set equal to union of parent and children sets. Returns ------- None
1.8.11
