Expand description
Directed graph (DiGraph) storage.
Mirrors the undirected [Graph] API with directed semantics:
- Edge
(u, v)is distinct from(v, u). - Adjacency is split into successors (outgoing) and predecessors (incoming).
neighbors(n)returns successors (matching NetworkX convention).
Structs§
- DiCsr
- br-r37-c1-d58s8 P1: integer CSR view of a DiGraph’s adjacency —
succ/pred targets are node INDICES (IndexMap insertion order) with
per-row slices in ROW order, so index walks reproduce the String
walks exactly. Built once per revision via
DiGraph::csr(). - DiGraph
- DiGraph
Snapshot - Multi
DiCsr - Revision-keyed integer CSR view of a MultiDiGraph’s distinct successor and predecessor rows. Parallel-edge keys are intentionally collapsed because this view is for multiplicity-insensitive structural algorithms.
- Multi
DiEdge Snapshot - Multi
DiGraph - Multi
DiGraph Snapshot