Module petgraph::graph [−][src]
Graph<N, E, Ty, Ix>
is a graph datastructure using an adjacency list representation.
Structs
Edge 
The graph's edge type. 
EdgeIndex 
Edge identifier. 
EdgeIndices 
Iterator over the edge indices of a graph. 
EdgeReference 
Reference to a 
EdgeReferences 
Iterator over all edges of a graph. 
EdgeWeightsMut 
Iterator yielding mutable access to all edge weights. 
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. 
Frozen 

Graph 

Neighbors 
Iterator over the neighbors of a node. 
Node 
The graph's node type. 
NodeIndex 
Node identifier. 
NodeIndices 
Iterator over the node indices of a graph. 
NodeReferences 
Iterator over all nodes of a graph. 
NodeWeightsMut 
Iterator yielding mutable access to all node weights. 
WalkNeighbors 
A “walker” object that can be used to step through the edge list of a node. 
Traits
GraphIndex 
A 
IndexType 
Trait for the unsigned integer type used for node and edge indices. 
Functions
edge_index 
Short version of 
node_index 
Short version of 
Type Definitions
DefaultIx 
The default integer type for graph indices.

DiGraph 
A 
UnGraph 
A 