I represent a Directed Acyclic Graph.
You can add objects to me as Nodes and then express dependency by
adding edges.
|
|
|
|
|
|
Boolean
|
|
|
|
|
|
|
addEdge(self,
parent,
child,
parenttype=0,
childtype=0)
I add an edge between two nodes in the DAG. |
source code
|
|
|
removeEdge(self,
parent,
child,
parenttype=0,
childtype=0)
I remove an edge between two nodes in the DAG. |
source code
|
|
list of (object, object)
|
getChildrenTyped(self,
object,
objtype=0,
types=None)
I return a list of (object, type) tuples that are direct children of
this object,objtype. |
source code
|
|
list of objects
|
getChildren(self,
object,
objtype=0,
types=None)
I return a list of objects that are direct children of this
object,objtype. |
source code
|
|
list of (object, object)
|
getParentsTyped(self,
object,
objtype=0,
types=None)
I return a list of (object, type) tuples that are direct parents of
this object, objtype. |
source code
|
|
list of (object, object)
|
getParents(self,
object,
objtype=0,
types=None)
I return a list of objects that are direct parents of this object,
objtype. |
source code
|
|
list of (object,Integer)
|
getOffspringTyped(self,
object,
objtype=0,
*types)
I return a list of (object, type) tuples that are offspring of this
object,objtype. |
source code
|
|
list of objects
|
getOffspring(self,
object,
objtype=0,
*types)
I return a list of objects that are offspring of this object,objtype. |
source code
|
|
list of (object,Integer)
|
getAncestorsTyped(self,
object,
objtype=0,
*types)
I return a list of (object, type) tuples that are ancestors of this
object,objtype. |
source code
|
|
list of objects
|
getAncestors(self,
object,
objtype=0,
*types)
I return a list of objects that are ancestors of this object,objtype. |
source code
|
|
Boolean
|
isFloating(self,
object,
objtype=0)
I return whether the object is floating: no parents and no children. |
source code
|
|
|
|
list of (object, type)
|
sort(self)
I return a topologically sorted list of objects. |
source code
|
|
list of {Node}
|
_sortPreferred(self,
list=None,
clearState=True)
I return a topologically sorted list of nodes, using list as a
preferred order for the algorithm. |
source code
|
|
|
|
list of object
|
getAllNodesByType(self,
type)
I return all the objects with node type specified by type |
source code
|
|
Inherited from extern.log.log.Loggable :
__providedBy__ ,
__provides__ ,
debug ,
doLog ,
error ,
info ,
log ,
logFunction ,
logObjectName ,
warning ,
warningFailure ,
writeMarker
|