| addVirtualEdge(self_t *graph, const TNodeID &from, const TNodeID &to) | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | inlineprivatestatic |
| BASE typedef | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | |
| begin() | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| begin() const | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| CDirectedGraph(const edges_map_t &obj) | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| CDirectedGraph() | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| clear() | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | inline |
| clearEdges() | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| CNetworkOfPoses() | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | inline |
| collapseDuplicatedEdges() | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | inline |
| connectGraphPartitions(self_t *sub_graph, const std::set< TNodeID > &groupA, const std::set< TNodeID > &groupB) | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | inlinestatic |
| const_iterator typedef | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | |
| const_reverse_iterator typedef | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | |
| constraint_no_pdf_t typedef | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | |
| constraint_t typedef | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | |
| countDifferentNodesInEdges() const | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| dijkstra_nodes_estimate() | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | inline |
| edge_annotations_t typedef | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | |
| edgeCount() const | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| edgeExists(TNodeID from_nodeID, TNodeID to_nodeID) const | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| edges | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | |
| edges_map_t typedef | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | |
| edges_store_inverse_poses | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | |
| end() | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| end() const | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| eraseEdge(TNodeID from_nodeID, TNodeID to_nodeID) | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| extractSubGraph(const std::set< TNodeID > &node_IDs, self_t *sub_graph, const TNodeID root_node_in=INVALID_NODEID, const bool &auto_expand_set=true) const | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | inline |
| getAdjacencyMatrix(MAP_NODEID_SET_NODEIDS &outAdjacency) const | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| getAdjacencyMatrix(MAP_NODEID_SET_NODEIDS &outAdjacency, const SET_NODEIDS &onlyForTheseNodes) const | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| getAllNodes(std::set< TNodeID > &lstNode_IDs) const | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| getAllNodes() const | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| getAs3DObject(mrpt::opengl::CSetOfObjectsPtr object, const mrpt::utils::TParametersDouble &viz_params) const | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | inline |
| getEdge(TNodeID from_nodeID, TNodeID to_nodeID) | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| getEdge(TNodeID from_nodeID, TNodeID to_nodeID) const | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| getEdges(TNodeID from_nodeID, TNodeID to_nodeID) | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| getEdges(TNodeID from_nodeID, TNodeID to_nodeID) const | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| getEdgeSquareError(const typename BASE::edges_map_t::const_iterator &itEdge, bool ignoreCovariances=true) const | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | inline |
| getEdgeSquareError(const mrpt::utils::TNodeID from_id, const mrpt::utils::TNodeID to_id, bool ignoreCovariances=true) const | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | inline |
| getGlobalSquareError(bool ignoreCovariances=true) const | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | inline |
| getNeighborsOf(const TNodeID nodeID, std::set< TNodeID > &neighborIDs) const | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| getNeighborsOf(const TNodeID nodeID) const | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| global_poses_pdf_t typedef | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | |
| global_poses_t typedef | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | |
| insertEdge(TNodeID from_nodeID, TNodeID to_nodeID, const edge_t &edge_value) | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| insertEdgeAtEnd(TNodeID from_nodeID, TNodeID to_nodeID, const edge_t &edge_value) | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| iterator typedef | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | |
| loadFromTextFile(const std::string &fileName, bool collapse_dup_edges=true) | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | inline |
| maps_implementation_t typedef | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | |
| mergeGraph(const self_t &other, const typename std::vector< detail::THypothesis< self_t > > &common_hypots, const bool hypots_from_other_to_self=true, std::map< TNodeID, TNodeID > *old_to_new_nodeID_mappings_out=NULL) | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | inline |
| node_annotations_t typedef | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | |
| nodeCount() const | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | inline |
| nodes | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | |
| rbegin() | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| rbegin() const | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| rend() | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| rend() const | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| reverse_iterator typedef | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | |
| root | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | |
| saveAsDot(std::ostream &o, const TGraphvizExportParams &p=TGraphvizExportParams()) const | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| saveAsDot(const std::string &fileName, const TGraphvizExportParams &p=TGraphvizExportParams()) const | mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS > | inline |
| saveToTextFile(const std::string &fileName) const | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | inline |
| self_t typedef | mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > | |