Custom exception class that passes information in case an unconnected graph is passed to a Dijkstra instance.
Definition at line 33 of file dijkstra.h.
#include <mrpt/graphs/dijkstra.h>
Public Member Functions | |
NotConnectedGraph (const std::set< mrpt::graphs::TNodeID > &unconnected_nodeIDs, std::string err) | |
const char * | what () |
~NotConnectedGraph () throw () | |
void | getUnconnectedNodeIDs (std::set< mrpt::graphs::TNodeID > *set_nodeIDs) const |
Fill set with the nodeIDs Dijkstra algorithm could not reach starting from the root node. More... | |
Private Attributes | |
std::set< mrpt::graphs::TNodeID > | m_unconnected_nodeIDs |
std::string | m_err |
|
inlineexplicit |
Definition at line 36 of file dijkstra.h.
|
inline |
Definition at line 45 of file dijkstra.h.
|
inline |
Fill set with the nodeIDs Dijkstra algorithm could not reach starting from the root node.
Definition at line 49 of file dijkstra.h.
References ASSERTMSG_, and m_unconnected_nodeIDs.
Referenced by mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::extractSubGraph().
|
inline |
Definition at line 44 of file dijkstra.h.
References m_err.
|
private |
Definition at line 66 of file dijkstra.h.
Referenced by what().
|
private |
Definition at line 65 of file dijkstra.h.
Referenced by getUnconnectedNodeIDs().
Page generated by Doxygen 1.8.17 for MRPT 1.9.9 Git: ad3a9d8ae Tue May 1 23:10:22 2018 -0700 at miƩ 12 jul 2023 10:03:34 CEST |