If you plan to use gs-paths for pathfinding you may be interrested in this function:

Feel free to contact me if you're in need of such function (sell/share).
It calculates the shortest distance from an entity to any position using the assigned (and complex) path:

demo (zip, 1.1MB)


[edit] for/using lite-c

Cool! Keep up the good work!

Thanx for your nice words... (the work is already done/finished)

How fast is your code for example for 500 nodes? Does the user notice that the function is running?

the ~100 nodes (of the demo) take ~200 microseconds (0.0002s) (using timer();) on my 2.4GHz Core2 CPU
(check the new demo [same link] for your pc)

[edit]the backtrace (find the previous node) takes the most time - so it depends a lot on the start and end position.

HOLY
SHIT!

damned... i worked on pathfinding all last summer... give me the wall
very good work

is this calculating nodes, wich i create in runtime, too???

This is for paths within 3DGS only and as far as i know you can't change the number of nodes/edges of these paths at runtime.
It's also not possible to create circles/loops with these paths.

For all this I've made the more flexible "flex-path-system":
http://www.opserver.de/ubb7/ubbthreads.php?ubb=showflat&Number=250177#Post250177

darn, this would really help me out... but am afraid i cant pay for it, funny thing is, cash isnt tha problem, i just havent been thru the whole 'buying stuff online' thing yet :-"...