Expand description
GraphMap<N, E, Ty> is a graph datastructure where node values are mapping
keys.
Macros§
Structs§
- AllEdges
- AllEdges
Mut - Edges
- Graph
Map GraphMap<N, E, Ty>is a graph datastructure using an associative array of its node weightsN.- Neighbors
- Neighbors
Directed - Node
Identifiers - Node
References - Nodes
- Ptr
- A reference that is hashed and compared by its pointer value.
Enums§
Traits§
- Node
Trait - A trait group for
GraphMap’s node identifier.
Functions§
- ptr_eq 🔒
Type Aliases§
- DiGraph
Map - A
GraphMapwith directed edges. - UnGraph
Map - A
GraphMapwith undirected edges.