File tree Expand file tree Collapse file tree 1 file changed +4
-3
lines changed Expand file tree Collapse file tree 1 file changed +4
-3
lines changed Original file line number Diff line number Diff line change @@ -22,7 +22,8 @@ def __init__(self, node):
22
22
23
23
24
24
class CycleError (ValueError ):
25
- """Subclass of ValueError raised by TopologicalSorterif cycles exist in the graph
25
+ """Subclass of ValueError raised by TopologicalSorter.prepare if cycles
26
+ exist in the working graph.
26
27
27
28
If multiple cycles exist, only one undefined choice among them will be reported
28
29
and included in the exception. The detected cycle can be accessed via the second
@@ -129,7 +130,7 @@ def get_ready(self):
129
130
return result
130
131
131
132
def is_active (self ):
132
- """Return True if more progress can be made and ``False`` otherwise.
133
+ """Return `` True`` if more progress can be made and ``False`` otherwise.
133
134
134
135
Progress can be made if cycles do not block the resolution and either there
135
136
are still nodes ready that haven't yet been returned by "get_ready" or the
@@ -149,7 +150,7 @@ def done(self, *nodes):
149
150
"""Marks a set of nodes returned by "get_ready" as processed.
150
151
151
152
This method unblocks any successor of each node in *nodes* for being returned
152
- in the future by a a call to "get_ready"
153
+ in the future by a call to "get_ready".
153
154
154
155
Raises :exec:`ValueError` if any node in *nodes* has already been marked as
155
156
processed by a previous call to this method, if a node was not added to the
You can’t perform that action at this time.
0 commit comments