Return a range that visits G in depth-first order using visited set S.
Declared in <llvm/ADT/DepthFirstIterator.h>
template<
class T,
class SetTy>
iterator_range<df_ext_iterator<T, SetTy>>
depth_first_ext(
T const& G,
SetTy& S);Iterator range covering a depth-first walk of G using S.
| Name | Description |
|---|---|
| G | Graph to traverse. |
| S | Caller-owned visited set. |