Depth‐first iterator over the inverse of graph T.
Synopsis
Declared in <llvm/ADT/DepthFirstIterator.h>
template<
class T,
class SetTy = df_iterator_default_set<GraphTraits<T>::NodeRef>,
bool External = false>
struct idf_iterator
: df_iterator<Inverse<T>, SetTy, External>
Base Classes
Name |
Description |
Generic depth‐first search iterator over a graph. |
Type Aliases
Name |
Description |
Distance between two depth‐first iterators. |
|
Iterator category: input when using external storage, otherwise forward. |
|
Pointer to a node reference. |
|
Const reference to the current node. |
|
Node reference type yielded by this iterator. |
Member Functions
Name |
Description |
|
Construct from an underlying inverse depth‐first iterator. |
Return the n'th node in the path from the entry node to the current node. |
|
Return the length of the path from the entry node to the current node, counting both nodes. |
|
Return true if this iterator has already visited |
|
Return a reference to the current node. |
|
Increment operators |
|
Return the current node so methods can be called through the iterator. |
|
Skips all children of the current node and traverses to next node |
|
Return true if both iterators have the same visit‐stack state. |
|
Return true if the iterators differ in visit‐stack state. |
Data Members
Name |
Description |
Set of nodes already visited during depth‐first traversal. |
Non-Member Functions
Name |
Description |
Return an inverse depth‐first iterator at the entry of |
|
Return a past‐the‐end inverse depth‐first iterator for |
|
Return a range that visits the inverse of |
Derived Classes
Name |
Description |
Inverse depth‐first iterator that stores its visited set externally. |
Created with MrDocs