Description
Visits each reachable node once, descending into children before siblings. When ExtStorage is true, the visited set is provided externally.
Type Aliases
| Name | Description |
difference_type | Distance between two depth-first iterators. |
iterator_category | Iterator category: input when using external storage, otherwise forward. |
pointer | Pointer to a node reference. |
reference | Const reference to the current node. |
value_type | Node reference type yielded by this iterator. |
Member Functions
| Name | Description |
getPath | Return the n'th node in the path from the entry node to the current node. |
getPathLength | Return the length of the path from the entry node to the current node, counting both nodes. |
nodeVisited | Return true if this iterator has already visited Node. |
operator* | Return a reference to the current node. |
operator++ | Increment operators |
operator-> | Return the current node so methods can be called through the iterator. |
skipChildren | Skips all children of the current node and traverses to next node |
operator== | Return true if both iterators have the same visit-stack state. |
operator!= | Return true if the iterators differ in visit-stack state. |
Static Member Functions
| Name | Description |
begin | begin overloads |
end | end overloads |
Data Members
| Name | Description |
Visited | Set of nodes already visited during depth-first traversal. |
Non-Member Functions
| Name | Description |
depth_first | Return a range that visits G in depth-first order. |
df_begin | Return a depth-first iterator at the entry of G. |
df_end | Return a past-the-end depth-first iterator for G. |