Never said that i wnat to workaround the graph with A* o.O. Did A* while ago, i know what it is, the major question was just about the speed(or have i spoken so unclearly? dont know^^, sometimes my english isnt very good).
Oh and nice idea todo a complete precalculation. Will try it(maybe) later. Depends on my current progress, and the current performance.
But thanks for your suggestions^^.
EDIT: ah okay foun the point where you misunderstood me. I used a Graph and an open(closed list system to see whether a node is used or not, so i used a graph in my A* version, too

Greets
Rackscha