#include <Prm.h>
List of all members.
Protected Types |
typedef
::boost::adjacency_list_traits
< ::boost::listS,::boost::listS,::boost::undirectedS,::boost::listS >
::vertex_descriptor | Vertex |
typedef
::boost::adjacency_list
< ::boost::listS,::boost::listS,::boost::undirectedS,
VertexBundle, EdgeBundle,
GraphBundle > | Graph |
typedef ::std::pair< const
::rl::math::Vector *, Vertex > | QueryItem |
typedef ::CGAL::Search_traits
< ::rl::math::Real, QueryItem,
const ::rl::math::Real
*, CartesianIterator > | SearchTraits |
typedef
Orthogonal_k_neighbor_search
< SearchTraits, Distance > | NeighborSearch |
typedef NeighborSearch::Tree | NeighborSearchTree |
typedef ::boost::shared_ptr
< NeighborSearchTree > | NeighborSearchTreePtr |
typedef ::std::vector
< NeighborSearchTreePtr > | NearestNeighbors |
typedef ::boost::graph_traits
< Graph >::edge_descriptor | Edge |
typedef ::boost::graph_traits
< Graph >::edge_iterator | EdgeIterator |
typedef ::std::pair
< EdgeIterator, EdgeIterator > | EdgeIteratorPair |
typedef ::boost::graph_traits
< Graph >::vertex_iterator | VertexIterator |
typedef ::std::pair
< VertexIterator,
VertexIterator > | VertexIteratorPair |
typedef ::boost::property_map
< Graph, void *VertexBundle::* >
::type | VertexParentMap |
typedef ::boost::property_map
< Graph,::std::size_t
VertexBundle::* >::type | VertexRankMap |
typedef ::std::pair< Vertex,::rl::math::Real > | Neighbor |
typedef ::std::priority_queue
< Neighbor,::std::vector
< Neighbor >, Compare > | NeighborQueue |
Detailed Description
Member Typedef Documentation
typedef ::boost::adjacency_list_traits< ::boost::listS, ::boost::listS, ::boost::undirectedS, ::boost::listS >::vertex_descriptor rl::plan::Prm::Vertex |
|
protected |
Constructor & Destructor Documentation
Member Function Documentation
void rl::plan::Prm::construct |
( |
const ::std::size_t & |
steps | ) |
|
|
virtual |
std::string rl::plan::Prm::getName |
( |
| ) |
const |
|
virtual |
std::size_t rl::plan::Prm::getNumEdges |
( |
| ) |
const |
std::size_t rl::plan::Prm::getNumVertices |
( |
| ) |
const |
void rl::plan::Prm::insert |
( |
const Vertex & |
vertex | ) |
|
|
protected |
void rl::plan::Prm::reset |
( |
| ) |
|
|
virtual |
bool rl::plan::Prm::solve |
( |
| ) |
|
|
virtual |
Member Data Documentation
::std::size_t rl::plan::Prm::degree |
Maximum degree per vertex.
Graph rl::plan::Prm::graph |
|
protected |
::std::size_t rl::plan::Prm::k |
Maximum number of tested neighbors.
Use kd-tree for nearest neighbor search instead of brute-force.
Maximum radius for connecting neighbors.
The documentation for this class was generated from the following files: