Return a range that visits the inverse of G in depth-first order.
Declared in <llvm/ADT/DepthFirstIterator.h>
template<class T>
iterator_range<idf_iterator<T>>
inverse_depth_first(T const& G);
Iterator range covering an inverse depth-first walk of G.
| Name | Description |
|---|---|
| G | Graph whose inverse edges are traversed. |