#include <OpenMapper.h>
Inheritance diagram for karto::GraphTraversal< T >:
Public Member Functions | |
| GraphTraversal (Graph< T > *pGraph) | |
| virtual List< T > | Traverse (Vertex< T > *pStartVertex, Visitor< T > *pVisitor)=0 |
| virtual | ~GraphTraversal () |
Protected Attributes | |
| Graph< T > * | m_pGraph |
Detailed Description
template<typename T>
class karto::GraphTraversal< T >
Graph traversal algorithm
Definition at line 410 of file OpenMapper.h.
Constructor & Destructor Documentation
template<typename T>
| karto::GraphTraversal< T >::GraphTraversal | ( | Graph< T > * | pGraph | ) | [inline] |
template<typename T>
| virtual karto::GraphTraversal< T >::~GraphTraversal | ( | ) | [inline, virtual] |
Destructor
Definition at line 425 of file OpenMapper.h.
Member Function Documentation
template<typename T>
| virtual List<T> karto::GraphTraversal< T >::Traverse | ( | Vertex< T > * | pStartVertex, |
| Visitor< T > * | pVisitor | ||
| ) | [pure virtual] |
Traverses the graph starting at the given vertex and applying the visitor to all visited nodes
- Parameters:
-
pStartVertex starting vertex pVisitor visitor
- Returns:
- list of vertices visited during traversal
Implemented in karto::BreadthFirstTraversal< T >.
Member Data Documentation
template<typename T>
Graph<T>* karto::GraphTraversal< T >::m_pGraph [protected] |
Graph being traversed
Definition at line 442 of file OpenMapper.h.
The documentation for this class was generated from the following file: