Ah ok, so for a Nodebased Level,
Dijkstra would fit?

@Uhrwerk: Ok the statement was a bit false^^.

Oh year and since we have pointed out the "slim" way...mh currently creating a quadtree search algorythm to find Nodes in the level without going through all nodes.
(like: find all nodes in a range of 100quants and check which of them is the nearest visible node to start from)

Do you think its worth it?

Greets
Rackscha