Graph.cpp File Reference

#include "rtabmap/core/Graph.h"
#include <rtabmap/utilite/ULogger.h>
#include <rtabmap/utilite/UStl.h>
#include <rtabmap/utilite/UMath.h>
#include <rtabmap/utilite/UConversion.h>
#include <pcl/search/kdtree.h>
#include <pcl/common/eigen.h>
#include <pcl/common/common.h>
#include <set>
#include <queue>
#include "toro3d/treeoptimizer3.hh"
#include "toro3d/treeoptimizer2.hh"

Include dependency graph for Graph.cpp:

Go to the source code of this file.

Classes
class	rtabmap::graph::Node
struct	rtabmap::graph::Order
Namespaces
namespace	rtabmap
namespace	rtabmap::graph
Typedefs
typedef std::pair< int, float >	rtabmap::graph::Pair
Functions
std::list< std::pair< int, Transform > > RTABMAP_EXP	rtabmap::graph::computePath (const std::map< int, rtabmap::Transform > &poses, const std::multimap< int, int > &links, int from, int to, bool updateNewCosts=false)
float RTABMAP_EXP	rtabmap::graph::computePathLength (const std::vector< std::pair< int, Transform > > &path, unsigned int fromIndex=0, unsigned int toIndex=0)
std::multimap< int, Link > ::iterator RTABMAP_EXP	rtabmap::graph::findLink (std::multimap< int, Link > &links, int from, int to)
std::multimap< int, int > ::iterator RTABMAP_EXP	rtabmap::graph::findLink (std::multimap< int, int > &links, int from, int to)
int RTABMAP_EXP	rtabmap::graph::findNearestNode (const std::map< int, rtabmap::Transform > &nodes, const rtabmap::Transform &targetPose)
std::map< int, float > RTABMAP_EXP	rtabmap::graph::getNodesInRadius (int nodeId, const std::map< int, Transform > &nodes, float radius)
std::map< int, Transform > RTABMAP_EXP	rtabmap::graph::getPosesInRadius (int nodeId, const std::map< int, Transform > &nodes, float radius)
std::multimap< int, int > RTABMAP_EXP	rtabmap::graph::radiusPosesClustering (const std::map< int, Transform > &poses, float radius, float angle)
std::map< int, Transform > RTABMAP_EXP	rtabmap::graph::radiusPosesFiltering (const std::map< int, Transform > &poses, float radius, float angle, bool keepLatest=true)