Expand description

A set of traits for subgraphs. A subgraph is a graph that is backed by an actual graph implementation, but that filters out some nodes or edges.

Traits

  • A subgraph type for which an empty instance can be constructed using an instance of the root graph type.
  • A type that represents a mutable subgraph, to which nodes and edges existing in the parent graph can be added, and nodes and edges can be removed.
  • A type that represents a subgraph of another graph.