| backtrackPath(const mrpt::graphs::TNodeID target_node, path_t &out_path) const | mrpt::nav::TMoveTree< NODE_TYPE_DATA, EDGE_TYPE, MAPS_IMPLEMENTATION > | inline |
| base_t typedef | mrpt::nav::TMoveTree< NODE_TYPE_DATA, EDGE_TYPE, MAPS_IMPLEMENTATION > | |
| clear() | mrpt::graphs::CDirectedTree< EDGE_TYPE > | inline |
| edge_t typedef | mrpt::nav::TMoveTree< NODE_TYPE_DATA, EDGE_TYPE, MAPS_IMPLEMENTATION > | |
| edges_to_children | mrpt::graphs::CDirectedTree< EDGE_TYPE > | |
| getAllNodes() const | mrpt::nav::TMoveTree< NODE_TYPE_DATA, EDGE_TYPE, MAPS_IMPLEMENTATION > | inline |
| getAsTextDescription() const | mrpt::graphs::CDirectedTree< EDGE_TYPE > | inline |
| getNearestNode(const NODE_TYPE_FOR_METRIC &query_pt, const PoseDistanceMetric< NODE_TYPE_FOR_METRIC > &distanceMetricEvaluator, double *out_distance=nullptr, const std::set< mrpt::graphs::TNodeID > *ignored_nodes=nullptr) const | mrpt::nav::TMoveTree< NODE_TYPE_DATA, EDGE_TYPE, MAPS_IMPLEMENTATION > | inline |
| getNextFreeNodeID() const | mrpt::nav::TMoveTree< NODE_TYPE_DATA, EDGE_TYPE, MAPS_IMPLEMENTATION > | inline |
| insertNode(const mrpt::graphs::TNodeID node_id, const NODE_TYPE_DATA &node_data) | mrpt::nav::TMoveTree< NODE_TYPE_DATA, EDGE_TYPE, MAPS_IMPLEMENTATION > | inline |
| insertNodeAndEdge(const mrpt::graphs::TNodeID parent_id, const mrpt::graphs::TNodeID new_child_id, const NODE_TYPE_DATA &new_child_node_data, const EDGE_TYPE &new_edge_data) | mrpt::nav::TMoveTree< NODE_TYPE_DATA, EDGE_TYPE, MAPS_IMPLEMENTATION > | inline |
| m_nodes | mrpt::nav::TMoveTree< NODE_TYPE_DATA, EDGE_TYPE, MAPS_IMPLEMENTATION > | private |
| node_map_t typedef | mrpt::nav::TMoveTree< NODE_TYPE_DATA, EDGE_TYPE, MAPS_IMPLEMENTATION > | |
| path_t typedef | mrpt::nav::TMoveTree< NODE_TYPE_DATA, EDGE_TYPE, MAPS_IMPLEMENTATION > | |
| root | mrpt::graphs::CDirectedTree< EDGE_TYPE > | |
| TListEdges typedef | mrpt::graphs::CDirectedTree< EDGE_TYPE > | |
| TMapNode2ListEdges typedef | mrpt::graphs::CDirectedTree< EDGE_TYPE > | |
| visitBreadthFirst(const TNodeID vroot, Visitor &user_visitor, const size_t root_depth_level=0) const | mrpt::graphs::CDirectedTree< EDGE_TYPE > | inline |
| visitDepthFirst(const TNodeID vroot, Visitor &user_visitor, const size_t root_depth_level=0) const | mrpt::graphs::CDirectedTree< EDGE_TYPE > | inline |