thanks guys, i was doing it that way for testing purposes, just to see how many nodes i can place and how long calculations would take. Before, i was storing each path for each node in the array(10000,10000) so the path for nodeA to NodeB would be seperate from NodeB to NodeA now they use the same path.
Im using a visibility function so if a node is visible to another node then that is the path instead of working the path through the links.
It takes about 2millisecs to work out a path on a 100*100 grid from node0 to node9999 with obstructions etc which is pretty fast when each node has upto 8 links, when i add in a visibility test it cuts it down to 0m depending on the map and obstructions.
ps. Its the first time i've done any pathfinding stuff so its all new to me.
Im using a visibility function so if a node is visible to another node then that is the path instead of working the path through the links.
It takes about 2millisecs to work out a path on a 100*100 grid from node0 to node9999 with obstructions etc which is pretty fast when each node has upto 8 links, when i add in a visibility test it cuts it down to 0m depending on the map and obstructions.
ps. Its the first time i've done any pathfinding stuff so its all new to me.