Expand description

Generic implementation for Topology

  • contains multiple measurable quantities
  • used by Graph<T> and SwGraph<T>

Structs

Breadth first search Iterator with index and depth of corresponding nodes
  • iterator returns tuple: (index, node, depth)
  • iterator uses filter to decide, if a vertex should be considered
  • Breadth first search Iterator with index and depth of corresponding nodes
    Depth first search Iterator
    Depth first search iterator
    Depth first search Iterator with index of corresponding nodes
    Generic graph implementation