Node Class Reference

A Node can store data to all valid neighbors (successors) and a precessor. More...

#include <armarx/navigation/algorithms/astar/Node.h>

Public Member Functions
EIGEN_MAKE_ALIGNED_OPERATOR_NEW	Node (const Eigen::Vector2f &position, float obstacleDistance)
std::vector< Eigen::Vector2f >	traversePredecessors () const
	Collects all predecessors in order to generate path to starting point. More...

Public Attributes
float	obstacleDistance
Eigen::Vector2f	position
NodePtr	predecessor
	For traversal. More...
std::vector< NodePtr >	successors
	All nodes that are adjacent to this one. More...

Detailed Description

A Node can store data to all valid neighbors (successors) and a precessor.

It offers methods to determine the complete path to the starting point.

Definition at line 17 of file Node.h.

Constructor & Destructor Documentation

Node()

Node	(	const Eigen::Vector2f &	position,
		float	obstacleDistance
	)

Definition at line 8 of file Node.cpp.

Member Function Documentation

traversePredecessors()

std::vector< Eigen::Vector2f > traversePredecessors

(

)

const

Collects all predecessors in order to generate path to starting point.

Definition at line 14 of file Node.cpp.

Member Data Documentation

obstacleDistance

float obstacleDistance

Definition at line 30 of file Node.h.

position

Eigen::Vector2f position

Definition at line 24 of file Node.h.

predecessor

NodePtr predecessor

For traversal.

Definition at line 28 of file Node.h.

successors

std::vector<NodePtr> successors

All nodes that are adjacent to this one.

Definition at line 26 of file Node.h.

---

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

• armarx/navigation/algorithms/astar/Node.h
• armarx/navigation/algorithms/astar/Node.cpp