13 / reference

Graph primitives

The graph containers used by the supported algorithms.

Edit this pageUpdated with the source

`Digraph`

Use Digraph for directed, unweighted graphs. Vertices retain insertion order, and vertices may be hashable Python objects.

`WeightedDigraph`

Use WeightedDigraph for directed graphs whose edge weights are validated by the graph implementation. Shortest-path and hopset APIs operate on this type.

See the source module ↗ for the current method surface.