pub fn strict_successors_of_set<G>(graph: G, set: &IxBitSet<G::NodeId>) -> IxBitSet<G::NodeId>
where
    G: IntoNeighbors,
    G::NodeId: IndexLike,
{
    set.iter()
        .flat_map(|n| graph.neighbors(n))
        .filter(|&n| !set.contains(n))
        .collect()
}
/// Returns the union of the successors of each node in `set` differenced
/// with `set`.
Returns the union of the successors of each node in `set` differenced
with `set`.
Returns the union of the successors of each node in ` set ` differenced with ` set ` .
pub fn strict_successors_of_set<G>(graph: G, set: &IxBitSet<G::NodeId>) -> IxBitSet<G::NodeId>
where
    G: IntoNeighbors,
    G::NodeId: IndexLike,
{
    set.iter()
        .flat_map(|n| graph.neighbors(n))
        .filter(|&n| !set.contains(n))
        .collect()
}
pub fn strict_successors_of_set < G > ( graph : G , set : & IxBitSet < G :: NodeId > ) -> IxBitSet < G :: NodeId > where G : IntoNeighbors , G :: NodeId : IndexLike , { set . iter ( ) . flat_map ( | n | graph . neighbors ( n ) ) . filter ( | & n | ! set . contains ( n ) ) . collect ( ) }
Returns the union of the successors of each node in `set` differenced
with `set`.
Returns the union of the successors of each node in ` set ` differenced with ` set ` .
graph
G
set
&IxBitSet<G::NodeId>
graph
G
set
&IxBitSet<G::NodeId>