iCelNode Struct Reference

Interface for CEL Node. More...

#include <tools/celgraph.h>

Inheritance diagram for iCelNode:

[legend]

List of all members.

Public Member Functions
virtual size_t	AddSuccessor (iCelNode *node, bool state, float weight)=0
	Adds a successor to this node, using a weight different then the euclidean distance between the two nodes (This will create a new edge).
virtual size_t	AddSuccessor (iCelNode *node, bool state)=0
	Adds a successor to this node (This will create a new edge).
virtual csArray< iCelNode * >	GetAllSuccessors ()=0
	Get all successors to this node.
virtual float	GetCost ()=0
	Get stored cost.
virtual iCelEdge *	GetEdge (size_t idx)=0
	Get a node by index.
virtual size_t	GetEdgeCount ()=0
	Get Number of Edges.
virtual csRefArray< iCelEdge >	GetEdges () const =0
	Get edges.
virtual float	GetHeuristic ()=0
	Get stored heuristic.
virtual iMapNode *	GetMapNode ()=0
	Get MapNode of this node.
virtual const char *	GetName ()=0
	Get name of this node.
virtual iCelNode *	GetParent ()=0
	Get Parent to this node.
virtual csVector3	GetPosition ()=0
	Get position of this node.
virtual csArray< iCelNode * >	GetSuccessors ()=0
	Get reachable successors to this node.
virtual void	Heuristic (float cost, iCelNode *goal)=0
	Calculates euclidean distance between this node and goal.
virtual void	RemoveEdge (size_t idx)=0
	Remove an edge.
virtual void	SetMapNode (iMapNode *node)=0
	Sets mapnode of this node.
virtual void	SetName (const char *par)=0
	Calculates euclidean distance between this node and goal.
virtual void	SetParent (iCelNode *par)=0
	Sets parent to this node.

---

Detailed Description

Interface for CEL Node.

Definition at line 69 of file celgraph.h.

---

Member Function Documentation

virtual size_t iCelNode::AddSuccessor	(	iCelNode *	node,
		bool	state,
		float	weight
	)			[pure virtual]

Adds a successor to this node, using a weight different then the euclidean distance between the two nodes (This will create a new edge).

virtual size_t iCelNode::AddSuccessor	(	iCelNode *	node,
		bool	state
	)			[pure virtual]

Adds a successor to this node (This will create a new edge).

virtual csArray<iCelNode*> iCelNode::GetAllSuccessors

(

)

[pure virtual]

Get all successors to this node.

virtual float iCelNode::GetCost

(

)

[pure virtual]

Get stored cost.

virtual iCelEdge* iCelNode::GetEdge

(

size_t

idx

)

[pure virtual]

Get a node by index.

virtual size_t iCelNode::GetEdgeCount

(

)

[pure virtual]

Get Number of Edges.

virtual csRefArray<iCelEdge> iCelNode::GetEdges

(

)

const [pure virtual]

Get edges.

virtual float iCelNode::GetHeuristic

(

)

[pure virtual]

Get stored heuristic.

virtual iMapNode* iCelNode::GetMapNode

(

)

[pure virtual]

Get MapNode of this node.

virtual const char* iCelNode::GetName

(

)

[pure virtual]

Get name of this node.

virtual iCelNode* iCelNode::GetParent

(

)

[pure virtual]

Get Parent to this node.

virtual csVector3 iCelNode::GetPosition

(

)

[pure virtual]

Get position of this node.

virtual csArray<iCelNode*> iCelNode::GetSuccessors

(

)

[pure virtual]

Get reachable successors to this node.

virtual void iCelNode::Heuristic	(	float	cost,
		iCelNode *	goal
	)			[pure virtual]

Calculates euclidean distance between this node and goal.

virtual void iCelNode::RemoveEdge

(

size_t

idx

)

[pure virtual]

Remove an edge.

virtual void iCelNode::SetMapNode

(

iMapNode *

node

)

[pure virtual]

Sets mapnode of this node.

virtual void iCelNode::SetName

(

const char *

par

)

[pure virtual]

Calculates euclidean distance between this node and goal.

virtual void iCelNode::SetParent

(

iCelNode *

par

)

[pure virtual]

Sets parent to this node.

---

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

• tools/celgraph.h