## Expand description

`Graph<N, E, Ty, Ix>`

is a graph datastructure using an adjacency list representation.

## Structs

- The graph’s edge type.
- Edge identifier.
- Iterator over the edge indices of a graph.
- Reference to a
`Graph`

edge. - Iterator over all edges of a graph.
- Iterator yielding mutable access to all edge weights.
- Iterator over the edges of from or to a node
- Iterator over the multiple directed edges connecting a source node to a target node
- An iterator over either the nodes without edges to them or from them.
`Frozen`

is a graph wrapper.`Graph<N, E, Ty, Ix>`

is a graph datastructure using an adjacency list representation.- Iterator over the neighbors of a node.
- The graph’s node type.
- Node identifier.
- Iterator over the node indices of a graph.
- Iterator over all nodes of a graph.
- Iterator yielding mutable access to all node weights.
- A “walker” object that can be used to step through the edge list of a node.

## Traits

- A
`GraphIndex`

is a node or edge index. - Trait for the unsigned integer type used for node and edge indices.

## Functions

- Short version of
`EdgeIndex::new`

- Short version of
`NodeIndex::new`

## Type Aliases

- The default integer type for graph indices.
`u32`

is the default to reduce the size of the graph’s data and improve performance in the common case. - A
`Graph`

with directed edges. - A
`Graph`

with undirected edges.