A minor complication is possible in depth: instead of querying the depths of nodes where a crossing by any path counts, we now accept a list of paths that should be included in this depth calculation. This PR beefs up slow-odgi's implementation of depth in exactly this way.
A minor complication is possible in
depth
: instead of querying the depths of nodes where a crossing by any path counts, we now accept a list of paths that should be included in this depth calculation. This PR beefs upslow-odgi
's implementation ofdepth
in exactly this way.