DepthFirstTreeIterator< Graph, VisitChildrenPred, VisitElementPred > Struct Template Reference

#include <DepthFirstTreeIterator.h>

Public Types
typedef boost::iterator_adaptor < boost::optional< typename boost::graph_traits< Graph > ::out_edge_iterator > , boost::optional< typename boost::graph_traits< Graph > ::out_edge_iterator > , typename boost::graph_traits < Graph >::edge_descriptor, boost::forward_traversal_tag, typename boost::graph_traits < Graph >::edge_descriptor, size_t >	type

Detailed Description

template<class Graph, class VisitChildrenPred = VisitTruePred<Graph>, class VisitElementPred = VisitTruePred<Graph>>
struct DepthFirstTreeIterator< Graph, VisitChildrenPred, VisitElementPred >

A default Depth first iterator

a b / \ / \ c d e f In this example (assuming that a and b have the same parent) the iteration order would be: a - c - d - b - e - f