end_nodes(graph)
|
Nodes at which an graph execution thread may end and which result need to be recorded. |
graph_has_conditional_links(graph)
|
|
graph_is_cyclic(graph)
|
|
has_required_predecessors(graph, node_id)
|
|
has_required_static_inputs(graph, node_id)
|
Returns True when the default inputs cover all required inputs. |
iter_downstream_nodes(graph, node_id, **kw)
|
|
iter_upstream_nodes(graph, node_id, **kw)
|
|
iterator_has_items(iterator)
|
|
link_has_conditions(graph, source_id, target_id)
|
|
link_has_on_error(graph, source_id, target_id)
|
|
link_has_required(graph, source_id, target_id)
|
|
link_is_conditional(graph, source_id, target_id)
|
|
link_is_required(graph, source_id, target_id)
|
|
node_ancestors(graph, node_id, **include_filter)
|
|
node_condition_values(graph, source_id)
|
|
node_descendants(graph, node_id, ...)
|
|
node_has_ancestors(graph, node_id, ...)
|
|
node_has_descendants(graph, node_id, ...)
|
|
node_has_error_handlers(graph, node_id)
|
|
node_has_noncovered_conditions(graph, source_id)
|
|
node_has_predecessors(graph, node_id, ...)
|
|
node_has_successors(graph, node_id, ...)
|
|
node_is_end_node(graph, node_id)
|
A pure end node or a node with uncovered conditions |
node_is_pure_end_node(graph, node_id)
|
Node without successors or only error handlers |
node_is_required(graph, node_id)
|
|
node_is_start_node(graph, node_id)
|
|
node_predecessors(graph, node_id, ...)
|
|
node_pure_descendants(graph, node_id[, ...])
|
Yields all descendants which do not depend on anything else than node_id |
node_successors(graph, node_id, **include_filter)
|
|
required_predecessors(graph, target_id)
|
|
start_nodes(graph)
|
Nodes from which the graph execution starts |
topological_sort(graph)
|
Sort node names for sequential instantiation+execution of DAGs |