Implement Dijkstra graph search algorithm. More...

#include <dijkstra.hpp>

Public Member Functions
	Dijkstra (Graph *ptrG)

void	creatStructures ()
	Creates the Maps out of the p3d Graph struct.

void	creatStructuresFromGrid (API::ThreeDGrid *grid)

void	computePaths (vertex_t source, adjacency_map_t &adjacency_map, std::map< vertex_t, weight_t > &min_distance, std::map< vertex_t, vertex_t > &previous)

std::list< vertex_t >	getShortestPathTo (vertex_t target, std::map< vertex_t, vertex_t > &previous)

int	example ()
	Example using the maps.

API::Trajectory *	extractTrajectory (std::tr1::shared_ptr< Configuration > init, std::tr1::shared_ptr< Configuration > goal)
	Extract Trajectory beetween two Configurations.

API::Trajectory *	extractTrajectory (vertex_t source, vertex_t target)
	Extract Trajectory beetween two Nodes.

Detailed Description

Implement Dijkstra graph search algorithm.

The documentation for this class was generated from the following files:

Public Member Functions