Return a range that visits the inverse of G in depth‐first order using visited set S.

Synopsis

Declared in <llvm/ADT/DepthFirstIterator.h>

template<
    class T,
    class SetTy>
iterator_range<idf_ext_iterator<T, SetTy>>
inverse_depth_first_ext(
    T const& G,
    SetTy& S);

Return Value

Iterator range covering an inverse depth‐first walk of G using S.

Parameters

Name

Description

G

Graph whose inverse edges are traversed.

S

Caller‐owned visited set.

Created with MrDocs