An example of binary search to find the first position whose element is negative. The DynamicArq version works on trees of any size, not necessarily a power of two.
(arq: &mut DynamicArq<super::specs::AssignMin>, view: ArqView)
source not stored for this graph (policy: none)