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

df_iterator<Inverse<T>, SetTy, External>

Generic depth‐first search iterator over a graph.

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

idf_iterator [constructor]

Construct from an underlying inverse depth‐first iterator.

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

idf_begin

Return an inverse depth‐first iterator at the entry of G.

idf_end

Return a past‐the‐end inverse depth‐first iterator for G.

inverse_depth_first

Return a range that visits the inverse of G in depth‐first order.

Derived Classes

Name

Description

idf_ext_iterator

Inverse depth‐first iterator that stores its visited set externally.

Created with MrDocs