Function libpijul::fs::iter_paths

pub fn iter_paths<T: GraphTxnT, F: FnMut(&mut dyn Iterator<Item = Position<ChangeId>>) -> bool>(
    txn: &T, 
    graph: &T::Graph, 
    key: Position<ChangeId>, 
    f: F
) -> Result<(), TxnErr<T::GraphError>>

Traverse the paths in the graph to a key. Warning: there might be a number of paths exponential in the number of conflicts.

This function takes a closure f, which gets called on each path with an iterator over the keys from the root to key. This function stops when f returns false (or when all the paths have been traversed).

See also iter_basenames.