graphs.Star.Star Class Reference

Public Member Functions
def	__init__ (self, node)
def	__lt__ (self, other)
def	recompute (self)
def	compute_weight (self)

Static Public Member Functions
def	get_missing_edges_of_node (nd)

Public Attributes
	node
	medges
	num_medges
	weight

Detailed Description

A Star contains a focus node and some extra information about edges of
its neighboring nodes. Since it is "centered" on one node, we call it a
star. (PBNT calls this class an InducedCluster). In our terminology,
once one adds the missing edges to a star, it becomes a preclique. If a
preclique is maximal (meaning that there are no cliques that contain
it), it is a clique.

Attributes
----------
medges : list[set[BayesNode]]
    medges here means missing edges
node : BayesNode
num_medges : int
    number of missing edges
weight : float

Constructor & Destructor Documentation

def graphs.Star.Star.__init__	(		self,
			node
	)

Constructor

Parameters
----------
node : BayesNode

Returns
-------

Member Function Documentation

def graphs.Star.Star.__lt__	(		self,
			other
	)

Overrides <. Used by TriangulatedGraph to order Stars in a
priority queue.

Parameters
----------
other : Star

Returns
-------
bool

def graphs.Star.Star.compute_weight

(

self

)

Compute self.weight

Returns
-------
float

def graphs.Star.Star.get_missing_edges_of_node (   nd )

static

Returns list of missing edges (medges) of node 'nd". By missing
edges we mean edges that don't exist between pairs of 'nd' parents.
By an edge we mean a set of two nodes.

Parameters
----------
nd : BayesNode

Returns
-------
list[set[BayesNode]]

def graphs.Star.Star.recompute

(

self

)

Recalculate Star internals after a node has been removed from the
graph.

Returns
-------
None

---

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

• graphs/Star.py