g2o::HyperDijkstra Struct Reference

#include <hyper_dijkstra.h>

Collaboration diagram for g2o::HyperDijkstra:

Classes
struct	CostFunction
struct	TreeAction
struct	AdjacencyMapEntry

Public Types
typedef std::map< HyperGraph::Vertex *, AdjacencyMapEntry >	AdjacencyMap

Public Member Functions
	HyperDijkstra (HyperGraph *g)
HyperGraph::VertexSet &	visited ()
AdjacencyMap &	adjacencyMap ()
HyperGraph *	graph ()
void	shortestPaths (HyperGraph::Vertex *v, HyperDijkstra::CostFunction *cost, double maxDistance=std::numeric_limits< double >::max(), double comparisonConditioner=1e-3, bool directed=false, double maxEdgeCost=std::numeric_limits< double >::max())
void	shortestPaths (HyperGraph::VertexSet &vset, HyperDijkstra::CostFunction *cost, double maxDistance=std::numeric_limits< double >::max(), double comparisonConditioner=1e-3, bool directed=false, double maxEdgeCost=std::numeric_limits< double >::max())

Static Public Member Functions
static void	computeTree (AdjacencyMap &amap)
static void	visitAdjacencyMap (AdjacencyMap &amap, TreeAction *action, bool useDistance=false)

Protected Member Functions
void	reset ()

Protected Attributes
AdjacencyMap	_adjacencyMap
HyperGraph::VertexSet	_visited
HyperGraph *	_graph

Detailed Description

Definition at line 38 of file hyper_dijkstra.h.

Member Typedef Documentation

AdjacencyMap

typedef std::map<HyperGraph::Vertex*, AdjacencyMapEntry> g2o::HyperDijkstra::AdjacencyMap

Definition at line 73 of file hyper_dijkstra.h.

Constructor & Destructor Documentation

HyperDijkstra()

g2o::HyperDijkstra::HyperDijkstra

(

HyperGraph *

g

)

Definition at line 65 of file hyper_dijkstra.cpp.

References _graph.

Member Function Documentation

adjacencyMap()

AdjacencyMap & g2o::HyperDijkstra::adjacencyMap ( )

inline

Definition at line 76 of file hyper_dijkstra.h.

References _adjacencyMap.

Referenced by g2o::computeSimpleStars(), and g2o::SolverSLAM2DLinear::solveOrientation().

computeTree()

void g2o::HyperDijkstra::computeTree ( AdjacencyMap & amap )

static

Definition at line 170 of file hyper_dijkstra.cpp.

References g2o::HyperDijkstra::AdjacencyMapEntry::_children, g2o::HyperDijkstra::AdjacencyMapEntry::child(), and g2o::HyperDijkstra::AdjacencyMapEntry::parent().

Referenced by g2o::computeSimpleStars(), and g2o::SolverSLAM2DLinear::solveOrientation().

graph()

HyperGraph * g2o::HyperDijkstra::graph ( )

inline

Definition at line 77 of file hyper_dijkstra.h.

References _graph.

reset()

void g2o::HyperDijkstra::reset ( )

protected

Definition at line 74 of file hyper_dijkstra.cpp.

References _adjacencyMap, and _visited.

Referenced by shortestPaths().

shortestPaths() [1/2]

void g2o::HyperDijkstra::shortestPaths	(	HyperGraph::Vertex *	v,
		HyperDijkstra::CostFunction *	cost,
		double	maxDistance = std::numeric_limits<double>::max(),
		double	comparisonConditioner = 1e-3,
		bool	directed = false,
		double	maxEdgeCost = std::numeric_limits<double>::max() )

Definition at line 159 of file hyper_dijkstra.cpp.

References shortestPaths().

Referenced by g2o::computeSimpleStars(), main(), shortestPaths(), and g2o::SolverSLAM2DLinear::solveOrientation().

shortestPaths() [2/2]

void g2o::HyperDijkstra::shortestPaths	(	HyperGraph::VertexSet &	vset,
		HyperDijkstra::CostFunction *	cost,
		double	maxDistance = std::numeric_limits<double>::max(),
		double	comparisonConditioner = 1e-3,
		bool	directed = false,
		double	maxEdgeCost = std::numeric_limits<double>::max() )

Definition at line 90 of file hyper_dijkstra.cpp.

References __PRETTY_FUNCTION__, _adjacencyMap, _visited, g2o::HyperDijkstra::AdjacencyMapEntry::child(), g2o::HyperGraph::Vertex::edges(), G2O_WARN, g2o::HyperGraph::Vertex::id(), reset(), g2o::HyperGraph::Edge::vertex(), and g2o::HyperGraph::Edge::vertices().

visitAdjacencyMap()

void g2o::HyperDijkstra::visitAdjacencyMap ( AdjacencyMap & amap, TreeAction * action, bool useDistance = false )

static

Definition at line 190 of file hyper_dijkstra.cpp.

References g2o::HyperDijkstra::AdjacencyMapEntry::parent(), and g2o::HyperDijkstra::TreeAction::perform().

Referenced by g2o::computeSimpleStars(), and g2o::SolverSLAM2DLinear::solveOrientation().

visited()

HyperGraph::VertexSet & g2o::HyperDijkstra::visited ( )

inline

Definition at line 75 of file hyper_dijkstra.h.

References _visited.

Referenced by main().

Member Data Documentation

_adjacencyMap

AdjacencyMap g2o::HyperDijkstra::_adjacencyMap

protected

Definition at line 97 of file hyper_dijkstra.h.

Referenced by adjacencyMap(), reset(), and shortestPaths().

_graph

HyperGraph* g2o::HyperDijkstra::_graph

protected

Definition at line 99 of file hyper_dijkstra.h.

Referenced by graph(), and HyperDijkstra().

_visited

HyperGraph::VertexSet g2o::HyperDijkstra::_visited

protected

Definition at line 98 of file hyper_dijkstra.h.

Referenced by reset(), shortestPaths(), and visited().

---

The documentation for this struct was generated from the following files:

• /build/reproducible-path/g2o-0~20230806/g2o/core/hyper_dijkstra.h
• /build/reproducible-path/g2o-0~20230806/g2o/core/hyper_dijkstra.cpp