Module stable_graph

A stripped down and modified version of petgraph’s StableUnGraph.

• Index types always use u32.
• Instead of free lists, IdPools are used to allocate and free nodes and edges.
• Vacant nodes and edges are occupied in the order of lowest index first.
• Edge iteration order after serialization/deserialization is preserved.
• Fewer iterators and helpers, and a few new ones.

Structs

EdgeMut

A mutable reference to a graph edge.

EdgeReference

A reference to a graph edge.

EdgeWeights

An iterator over edge weights for edges from or to a node.

Edges

An iterator over edges from or to a node.

EdgesBetween

Iterator over the edges between a source node and a target node.

Neighbors

An iterator over the neighbors of a node.

StableUnGraph

A graph with undirected edges and stable indices.