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. |
| Edges |
Iterator over the edges of a node. |
| Graph |
Graph<N, E, Ty, Ix> is a graph datastructure using an adjacency list representation. |
| Neighbors |
Iterator over the neighbors of a node. |
| Node |
The graph's node type. |
| NodeIndex |
Node identifier. |
| WithoutEdges |
An iterator over either the nodes without edges to them or from them. |
Traits
| IndexType |
Trait for the unsigned integer type used for node and edge indices. |
Type Definitions
| DefIndex |
The default integer type for node and edge indices in Graph. u32 is the default to reduce the size of the graph's data and improve performance in the common case. |