MeshKit  1.0
DijkstraShortestPath Class Reference

#include <DijkstraShortestPath.hpp>

List of all members.

Classes

struct  LVertex

Public Member Functions

 DijkstraShortestPath (Mesh *m, int mtype=0)
const NodeSequencegetPath (Vertex *vs, Vertex *vd=NULL)
const NodeSequencegetPath (Vertex *vs, MeshFilter *f)

Private Member Functions

int atomicOp (LVertex &node)
void fastmarching ()
void traceback ()
double getCost (const LVertex &vi, const LVertex &vj) const

Private Attributes

Meshmesh
Vertexvsrc
Vertexvdst
MeshFilterfilter
NodeSequence nodepath
int distance_measure_method
bool complete_path_known
std::map< Vertex *, LVertexvmap
std::map< Vertex *, LVertex >
::const_iterator 
miter
std::priority_queue< LVertex,
vector< LVertex >, greater
< LVertex > > 
vertexQ

Detailed Description

Definition at line 15 of file DijkstraShortestPath.hpp.


Constructor & Destructor Documentation

DijkstraShortestPath ( Mesh m,
int  mtype = 0 
) [inline]

Definition at line 17 of file DijkstraShortestPath.hpp.


Member Function Documentation

int atomicOp ( LVertex node) [private]

Definition at line 6 of file DijkstraShortestPath.cpp.

void fastmarching ( ) [private]

Definition at line 78 of file DijkstraShortestPath.cpp.

double getCost ( const LVertex vi,
const LVertex vj 
) const [inline, private]

Definition at line 100 of file DijkstraShortestPath.hpp.

const NodeSequence& getPath ( Vertex vs,
Vertex vd = NULL 
) [inline]

Definition at line 26 of file DijkstraShortestPath.hpp.

const NodeSequence& getPath ( Vertex vs,
MeshFilter f 
) [inline]

Definition at line 37 of file DijkstraShortestPath.hpp.

void traceback ( ) [private]

Definition at line 57 of file DijkstraShortestPath.cpp.


Member Data Documentation

bool complete_path_known [private]

Definition at line 60 of file DijkstraShortestPath.hpp.

int distance_measure_method [private]

Definition at line 59 of file DijkstraShortestPath.hpp.

MeshFilter* filter [private]

Definition at line 53 of file DijkstraShortestPath.hpp.

Mesh* mesh [private]

Definition at line 51 of file DijkstraShortestPath.hpp.

std::map<Vertex*, LVertex>::const_iterator miter [private]

Definition at line 91 of file DijkstraShortestPath.hpp.

Definition at line 56 of file DijkstraShortestPath.hpp.

Vertex * vdst [private]

Definition at line 52 of file DijkstraShortestPath.hpp.

std::priority_queue<LVertex, vector<LVertex>, greater<LVertex> > vertexQ [private]

Definition at line 94 of file DijkstraShortestPath.hpp.

std::map<Vertex*, LVertex> vmap [private]

Definition at line 90 of file DijkstraShortestPath.hpp.

Vertex* vsrc [private]

Definition at line 52 of file DijkstraShortestPath.hpp.


The documentation for this class was generated from the following files:
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines