Module graph 

Graph data structure with typed node and edge identifiers.

Graph stores node and edge payloads in separate maps and exposes typed reference wrappers (NodeRef, NodeMutRef, EdgeRef, EdgeMutRef) to navigate and mutate the structure.

Re-exports

pub use edge::Edge;

pub use edge::EdgeMut;

pub use node::Node;

pub use node::NodeMut;

pub use parse::TestGraph;

Modules

analysis

Graph analysis algorithms.

edge

Edge views for immutable and mutable graph access.

node

Node views and traversal iterators for the graph.

owning

parse

Structs

DfsIter

Depth-first traversal iterator over graph nodes.

Directed

FxBuildHasher

Recommended fixed-seed hasher for Graph::Hasher.

Undirected

Traits

Cfg

A minimal control-flow-graph view: the successor relation on node ids.

Graph

A typed graph container.

GraphMut

The mutable half of Graph: node/edge handles that can rewrite the graph structure, plus structural edits.