PBNT.Graph.TriangleGraph Class Reference

Inheritance diagram for PBNT.Graph.TriangleGraph:

Collaboration diagram for PBNT.Graph.TriangleGraph:

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

Public Attributes
	cliques
Public Attributes inherited from PBNT.Graph.Graph
	nodes

Detailed Description

TriangleGraph is constructed from the MoralGraph.  It is the triangulated graph.  It is constructed by identifying clusters of nodes according to a given heuristic.  There are many heuristics that can be used, and in this implementation the heuristic is implemented in the ClusterBinaryHeap and can therefore be changed independent of this class.  The heap acts as a priority queue.  After the heap has been created, we remove nodes from the heap and use the information to create Cliques.  The Cliques are then added to the graph if they are not contained in a previous Clique.  TODO: Move addClique to this class from GraphUtilities.  Reimplement ClusterBinaryHeap as a built in python priority queue.

---

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

• PBNT/Graph.py