Function subgraph 

pub(crate) fn subgraph(
    target: &UnitId,
    i: &Inputs<'_>,
) -> BTreeMap<UnitId, Vec<UnitId>>

The divergent units reachable from target through walkable edges, with their walkable edges among themselves.