Spec DfsPreorderIterator
Iterate vertices of a graph in depth-first preorder fashion.

Extends Iter
All Extended Iter
All Impl'd IteratorAssociatedTypesConcept
Defined in <seqan/graph_types.h>
Signature Iterator<TGraph, DfsPreorderIterator>::Type; template <typename TGraph, typename TSpec> class Iter<TGraph, GraphIterator<InternalDfsPreorderIterator<TSpec> >;

Template Parameters

TGraph The graph to iterate the vertices of.

Member Function Overview

Member Functions Inherited From Iter

Interface Function Overview

Interface Functions Inherited From IteratorAssociatedTypesConcept

Interface Metafunction Overview

Interface Metafunctions Inherited From Iter

Interface Metafunctions Inherited From IteratorAssociatedTypesConcept

Detailed Description

Preorder means that a vertex is visited before its neighbours are.

The first signature is the signature of the corresponding graph's Iterator metafunction call. The second call is the internal definition of the type. You should always get this type using the metafunction call from the first signature.

Member Functions Detail

Iter::Iter(); Iter::Iter(iter); Iter::Iter(graph, v);



iter Other DfsPreorderIterator to copy from.
graph The Graph to iterate vertices in DFS preorder fashion.
v The descriptor of the vertex to start DFS preorder iteration.