graphs.MoralGraph.MoralGraph Class Reference

Inheritance diagram for graphs.MoralGraph.MoralGraph:

Collaboration diagram for graphs.MoralGraph.MoralGraph:

Public Member Functions
def	__init__ (self, dag)
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)

Additional Inherited Members
Static Public Member Functions inherited from graphs.Graph.Graph
def	new_from_nx_graph (nx_graph)
Public Attributes inherited from graphs.Graph.Graph
	nodes

Detailed Description

Constructing a MoralGraph from a BayesNet is a preliminary step required
by JoinTreeEngine. A MoralGraph is an undirected graph that is
constructed from a directed graph by connecting all of the parents and
dropping the direction of the edges.

Attributes
----------
nodes : set[Node]

Constructor & Destructor Documentation

def graphs.MoralGraph.MoralGraph.__init__	(		self,
			dag
	)

Constructor

Parameters
----------
dag : Dag

Returns
-------

---

The documentation for this class was generated from the following file:

• graphs/MoralGraph.py