sorted_nodes

method of dascore.workflow.pipe.Pipe

source

sorted_nodes(
    self ,
)-> ‘tuple[str, …]’

Return the nodes in an order which runs each after its inputs.

Kahn’s algorithm, seeded with the sources in the order the pipe is fed, so a pipe always runs its tasks the same way round. Which of two independent branches runs first is not part of what a pipe means: tasks are pure, and the fingerprint is built on the shape of the graph rather than on any one walk of it.