Expand description
Various iterators for graph traits.
Structs§
- ArcIterator
- Similar to EdgeIterator but for arcs of digraphs.
- DTFArc
Iterator - Arc iterator for DTFGraph. If the iterator is in ‘all depths’ mode it iterates over all arcs of the augmentation. If the iterator operates on one specific depth $d$ then it only return arcs with weight (depth) $d$.
- DTFN
Iterator - Neighbourhood iterator for DTFGraph. At each step, the iterator returns a pair $(v,X)$ where $X$ is a certain subset of the in-neighbours of $v$. If the iterator is in ‘all depths’ mode, $X$ is simply $v$’s in-neighbourhood. If the iterator operates on one specific depth $d$, then $X$ contains all vertices that can reach $v$ via an arc of weight $d$.
- DiNeigh
Iterator - Neighbourhood iterators for digraphs which eithe returns all in- or all out-neighbourhoods. At each step, the iterator returns a pair $(v,N^-(v))$ when in in-neighbourhood mode and $(v,N^+(V))$ when in out-neighbourhood mode.
- Edge
Iterator - Edge iterator for graphs. Each edge is returned with the smaller vertex first, so the edge $\{15,3\}$ would be returned as $(3,15)$.
- Left
Neigh Iterator - Left-neighbourhood iterators for linear graphs. At each step, the iterator returns a pair $(v,L(v))$.
- Mixed
Iterator - An iterator that returns all vertices and edges of the graph.
- Neigh
Iterator - Neighbourhood iterators for graphs. At each step, the iterator returns a pair $(v,N(v))$.
Traits§
- ArcIterable
- Allows construction of ArcIterator.
- DiNeigh
Iterable - Allows construction of a DiNeighIterator.
- Edge
Iterable - Allows construction of EdgeIterator.
- Left
Neigh Iterable - Allows construction of a LeftNeighIterator.
- Mixed
Iterable - Neigh
Iterable - Allows construction of a NeighIterator.