Module gdsl::sync_ungraph

source ·
Expand description

Undirected Graph

Structs

  • Edge
    An edge between nodes is a tuple struct Edge(u, v, e) where u is the source node, v is the target node, and e is the edge’s value.
  • Graph
  • Node
    A Node<K, N, E> is a key value pair smart-pointer, which includes inbound and outbound connections to other nodes. Nodes can be created individually and they don’t depend on a graph container. Generic parameters include K for the node’s key, N for the node’s value, and E for the edge’s value. Two nodes are equal if they have the same key.
  • NodeIterator