#include <Mapper.h>
Public Member Functions | |
GraphTraversal (Graph< T > *pGraph) | |
virtual std::vector< T * > | Traverse (Vertex< T > *pStartVertex, Visitor< T > *pVisitor)=0 |
virtual | ~GraphTraversal () |
Protected Attributes | |
Graph< T > * | m_pGraph |
Graph traversal algorithm
karto::GraphTraversal< T >::GraphTraversal | ( | Graph< T > * | pGraph | ) | [inline] |
virtual karto::GraphTraversal< T >::~GraphTraversal | ( | ) | [inline, virtual] |
virtual std::vector<T*> karto::GraphTraversal< T >::Traverse | ( | Vertex< T > * | pStartVertex, |
Visitor< T > * | pVisitor | ||
) | [pure virtual] |
Traverse the graph starting at the given vertex and applying the visitor to all visited nodes
pStartVertex | |
pVisitor |
Implemented in karto::BreadthFirstTraversal< T >.
Graph<T>* karto::GraphTraversal< T >::m_pGraph [protected] |