Post top tier code

Can be yours or not, I just want to see something good.

>>14
Yep, >>13 builds a couple of tables for a recursive graph search, and a spatial edge index. mapx(LocY, LocX) gives an edge index+1 >=2, or ==1 on a Node, then you can get the next two Nodes for a given edge, and up to four Edges for a given Node..
The nice bit is these should work concurrently, so depth 4 and starting on an edge gives [all nodes(4)] connected to [all edges(3)] connected to [all nodes(2)] connected to [initial edge(1)], in four operations =)