![]() |
Quantum Fog
0.9.3
|


Public Member Functions | |
| def | __init__ (self, DAG) |
| def | deep_copy_nodes (self) |
Public Member Functions inherited from PBNT.Graph.Graph | |
| def | __init__ (self, nodes) |
| def | add_node (self, node) |
| def | member_of (self, node) |
| def | contains (self, nodes) |
| def | connect_nodes (self, node1, node2) |
Additional Inherited Members | |
Public Attributes inherited from PBNT.Graph.Graph | |
| nodes | |
A MoralGraph is an undirected graph that is built by connecting all of the parents of a directed graph and dropping the direction of the edges.
1.8.11