Data structure to represent dependency graphs. Each dependency arc is
represented as a pair of indices, with a label.
Node index 0 has a special meaning: it is the root node.
|
|
__init__(self,
arcs=[],
words=[])
x.__init__(...) initializes x; see help(type(x)) for signature |
source code
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
root_arcs(self)
Returns all the arcs coming directly from the root node. |
source code
|
|
|
|
|
|
Inherited from object:
__delattr__,
__format__,
__getattribute__,
__hash__,
__new__,
__reduce__,
__reduce_ex__,
__repr__,
__setattr__,
__sizeof__,
__subclasshook__
|