[−][src]Module generic_graph::adjacency_list
This module provide an implementation of a growable directed graph. The graph is implemented as a set of adjacency list (list of vertex adjacent to one vertex).
These lists consists of HashMaps, allowing the graph to grow to a considerable size while still maintaining a certain speed. Though it is not indicated for small or not growing graphs
Modules
elements | This module provides the implementation of the Edge type, the Vertex type and the edges' key type, to use with the AdjacencyGraph type |
Structs
AdjacencyGraph |
|