|
| void | insertHistogram (const graph::HistogramPtr_t hist) |
| |
| void | constraintGraph (const graph::GraphPtr_t &graph) |
| | Register the constraint graph to do statistics.
|
| |
| void | clear () |
| | Clear the histograms and call parent implementation.
|
| |
| void | push_node (const core::NodePtr_t &n) |
| | Catch event 'New node added'.
|
| |
| RoadmapNodePtr_t | nearestNodeInState (ConfigurationIn_t configuration, const ConnectedComponentPtr_t &connectedComponent, const graph::StatePtr_t &state, value_type &minDistance) const |
| |
| void | connect (const LeafConnectedCompPtr_t &cc1, const LeafConnectedCompPtr_t &cc2) |
| |
| void | merge (const LeafConnectedCompPtr_t &cc1, LeafConnectedComp::LeafConnectedComps_t &ccs) |
| |
| graph::StatePtr_t | getState (RoadmapNodePtr_t node) |
| | Get graph state corresponding to given roadmap node.
|
| |
| const LeafConnectedComps_t & | leafConnectedComponents () const |
| |
| NodePtr_t | addNode (ConfigurationIn_t config) |
| |
| NodePtr_t | nearestNode (ConfigurationIn_t configuration, value_type &minDistance, bool reverse=false) |
| |
| NodePtr_t | nearestNode (ConfigurationIn_t configuration, const ConnectedComponentPtr_t &connectedComponent, value_type &minDistance, bool reverse=false) |
| |
| Nodes_t | nearestNodes (ConfigurationIn_t configuration, size_type k) |
| |
| Nodes_t | nearestNodes (ConfigurationIn_t configuration, const ConnectedComponentPtr_t &connectedComponent, size_type k) |
| |
| NodeVector_t | nodesWithinBall (ConfigurationIn_t configuration, const ConnectedComponentPtr_t &connectedComponent, value_type maxDistance) |
| |
| NodePtr_t | addNodeAndEdges (const NodePtr_t from, ConfigurationIn_t to, const PathPtr_t path) |
| |
| NodePtr_t | addNodeAndEdge (const NodePtr_t from, ConfigurationIn_t to, const PathPtr_t path) |
| |
| NodePtr_t | addNodeAndEdge (ConfigurationIn_t from, const NodePtr_t to, const PathPtr_t path) |
| |
| EdgePtr_t | addEdge (const NodePtr_t &n1, const NodePtr_t &n2, const PathPtr_t &path) |
| |
| void | addEdges (const NodePtr_t from, const NodePtr_t &to, const PathPtr_t &path) |
| |
| void | merge (const RoadmapPtr_t &other) |
| |
| void | insertPathVector (const PathVectorPtr_t &path, bool backAndForth) |
| |
| NodePtr_t | addGoalNode (ConfigurationIn_t config) |
| |
| void | resetGoalNodes () |
| |
| void | initNode (ConfigurationIn_t config) |
| |
| virtual | ~Roadmap () |
| |
| bool | pathExists () const |
| |
| const Nodes_t & | nodes () const |
| |
| const Edges_t & | edges () const |
| |
| NodePtr_t | initNode () const |
| |
| const NodeVector_t & | goalNodes () const |
| |
| const ConnectedComponents_t & | connectedComponents () const |
| |
| NearestNeighborPtr_t | nearestNeighbor () |
| |
| void | nearestNeighbor (NearestNeighborPtr_t nearestNeighbor) |
| |
| std::ostream & | print (std::ostream &os) const |
| |
| const DistancePtr_t & | distance () const |
| |
| const path::CostPtr_t | cost () const |
| |
| void | cost (const path::CostPtr_t &cost) |
| |
| const DistancePtr_t & | distance () const |
| |
| const path::CostPtr_t | cost () const |
| |
| void | cost (const path::CostPtr_t &cost) |
| |
Extension of hpp::core::Roadmap. It adds the ability of doing statistics on the graph