Module digraph

GraphMap<N, E, Ty> is a graph datastructure where node values are mapping keys.

Structs

• AllEdges
• AllEdgesMut
• Edges
• FastGraphMap
  GraphMap<N, E, Ty> is a graph datastructure using an associative array of its node weights N.
• Neighbors
• NeighborsDirected
• NodeIdentifiers
• NodeReferences
• Nodes
• Ptr
  A reference that is hashed and compared by its pointer value.

Traits

• NodeTrait
  A trait group for GraphMap’s node identifier.

Type Aliases

• FastDiGraphMap
  A GraphMap with directed edges.