/// A subgraph implementation based on bitvectors.
/// Iterators that filter out nodes or edges missing from subgraphs.
/// A subgraph implementation that allows to combine multiple subgraphs into one if they are totally ordered by the subset relation.
/// A subgraph implementation based on bitvectors.
///
/// This subgraph only allows to enable or disable nodes,
/// and edges are automatically contained if their endpoints exist.
/// A subgraph implementation that allows to combine multiple subgraphs into one if they are totally ordered by the subset relation.
///
/// This subgraph only allows to enable or disable nodes,
/// and edges are automatically contained if their endpoints exist.
/// Inverting subgraphs and computing the union or cut set of subgraphs.