Module petgraph::stable_graph[−][src]

Expand description

StableGraph keeps indices stable across removals.

Depends on feature = "stable_graph".

Re-exports

`pub use crate::graph::edge_index;`
`pub use crate::graph::node_index;`
`pub use crate::graph::DefaultIx;`
`pub use crate::graph::EdgeIndex;`
`pub use crate::graph::GraphIndex;`
`pub use crate::graph::IndexType;`
`pub use crate::graph::NodeIndex;`

EdgeIndices	Iterator over the edge indices of a graph.
EdgeReference	Reference to a `StableGraph` edge.
EdgeReferences	Iterator over all edges of a graph.
Edges	Iterator over the edges of from or to a node
Externals	An iterator over either the nodes without edges to them or from them.
Neighbors	Iterator over the neighbors of a node.
NodeIndices	Iterator over the node indices of a graph.
NodeReferences	Iterator over all nodes of a graph.
StableGraph	`StableGraph<N, E, Ty, Ix>` is a graph datastructure using an adjacency list representation.
WalkNeighbors	A “walker” object that can be used to step through the edge list of a node.

StableDiGraph	A `StableGraph` with directed edges.
StableUnGraph	A `StableGraph` with undirected edges.