For a pathfinding like this, define your nodes as structs.

Example:

Code:
typedef struct NODE
{
  VECTOR pos;
  integer connectionCount;
  struct NODE* connections;
};


This node holds a position, how many nodes are connected to it, and a pointer to an allocated array which includes pointers pointing to the connected nodes.

if you need to visualize your nodegraph, lookup for the draw_ methods in the manual.

If you use real entities, you'll end up consuming to much memory(and might get a message for to much entities anyway)

PS: the above is just a simple example, try to find the best way for you wink

Greetings
Rackscha


MY Website with news of my projects:
(for example my current
Muliplayer Bomberman,
GenesisPrecompiler for LiteC
and TileMaster, an easy to use Tile editor)
Sparetime-Development