This is a mapnode Graph for CEL.
More...
#include <celgraph.h>
|
| virtual void | AddEdge (iCelNode *from, iCelNode *to, bool state) |
| |
| virtual size_t | AddEdge (iCelNode *from, iCelNode *to, bool state, float weight) |
| |
| virtual bool | AddEdgeByNames (const char *from, const char *to, bool state) |
| |
| virtual size_t | AddNode (iCelNode *node) |
| |
| | celGraph (iBase *parent) |
| |
| virtual iCelNode * | CreateEmptyNode (size_t &index) |
| |
| virtual iCelNode * | CreateNode (const char *name, csVector3 &pos) |
| |
| virtual iCelNode * | GetClosest (csVector3 position) |
| |
| virtual iCelNode * | GetNode (size_t idx) |
| |
| virtual size_t | GetNodeCount () |
| |
| virtual bool | Initialize (iObjectRegistry *object_reg) |
| |
| virtual iObject * | QueryObject () |
| |
| virtual iCelNode * | RandomPath (iCelNode *from, int distance, iCelPath *path) |
| |
| virtual void | RemoveEdge (iCelNode *from, size_t idx) |
| |
| virtual void | RemoveNode (size_t idx) |
| |
| virtual bool | ShortestPath (iCelNode *from, iCelNode *goal, iCelPath *path) |
| |
| virtual bool | ShortestPath2 (iCelNode *from, iCelNode *goal, iCelPath *path) |
| |
| virtual | ~celGraph () |
| |
This is a mapnode Graph for CEL.
Definition at line 136 of file celgraph.h.
| celGraph::celGraph |
( |
iBase * |
parent | ) |
|
| virtual celGraph::~celGraph |
( |
| ) |
|
|
virtual |
| virtual void celGraph::AddEdge |
( |
iCelNode * |
from, |
|
|
iCelNode * |
to, |
|
|
bool |
state |
|
) |
| |
|
virtual |
| virtual size_t celGraph::AddEdge |
( |
iCelNode * |
from, |
|
|
iCelNode * |
to, |
|
|
bool |
state, |
|
|
float |
weight |
|
) |
| |
|
virtual |
| virtual bool celGraph::AddEdgeByNames |
( |
const char * |
from, |
|
|
const char * |
to, |
|
|
bool |
state |
|
) |
| |
|
virtual |
| virtual size_t celGraph::AddNode |
( |
iCelNode * |
node | ) |
|
|
virtual |
| virtual iCelNode* celGraph::CreateEmptyNode |
( |
size_t & |
index | ) |
|
|
virtual |
| virtual iCelNode* celGraph::CreateNode |
( |
const char * |
name, |
|
|
csVector3 & |
pos |
|
) |
| |
|
virtual |
| virtual iCelNode* celGraph::GetClosest |
( |
csVector3 |
position | ) |
|
|
virtual |
| virtual iCelNode* celGraph::GetNode |
( |
size_t |
idx | ) |
|
|
inlinevirtual |
| virtual size_t celGraph::GetNodeCount |
( |
| ) |
|
|
inlinevirtual |
| virtual bool celGraph::Initialize |
( |
iObjectRegistry * |
object_reg | ) |
|
|
virtual |
| virtual iObject* celGraph::QueryObject |
( |
| ) |
|
|
inlinevirtual |
| virtual iCelNode* celGraph::RandomPath |
( |
iCelNode * |
from, |
|
|
int |
distance, |
|
|
iCelPath * |
path |
|
) |
| |
|
virtual |
| virtual void celGraph::RemoveEdge |
( |
iCelNode * |
from, |
|
|
size_t |
idx |
|
) |
| |
|
virtual |
| virtual void celGraph::RemoveNode |
( |
size_t |
idx | ) |
|
|
virtual |
| virtual bool celGraph::ShortestPath |
( |
iCelNode * |
from, |
|
|
iCelNode * |
goal, |
|
|
iCelPath * |
path |
|
) |
| |
|
virtual |
| virtual bool celGraph::ShortestPath2 |
( |
iCelNode * |
from, |
|
|
iCelNode * |
goal, |
|
|
iCelPath * |
path |
|
) |
| |
|
virtual |
The documentation for this class was generated from the following file:
1.8.11