walk
walk(
self ,
)-> ‘Iterator[ProvenanceNode]’
Yield every node behind this one and then this one, each once.
Oldest first, so a node is always yielded after the nodes which fed it. A graph which narrows – many files chunked into one patch – shares its ancestors, so a node reached twice is yielded once.