PBNT.Graph.DAG Class Reference

Inheritance diagram for PBNT.Graph.DAG:

Collaboration diagram for PBNT.Graph.DAG:

Public Member Functions
def	__init__ (self, nodes)
def	topological_sort (self)
def	undirect (self)
def	add_node (self, node)
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
	numNodes
	nodes
Public Attributes inherited from PBNT.Graph.Graph
	nodes

Detailed Description

Child of Graph class.  It is very similar to Graph class with the addition of a couple of methods aimed at a graph of nodes that are directed.  Currently this class does not ensure that it is acyclic, but it is assumed that the user will not violate this principle.

---

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

• PBNT/Graph.py