maybe you want to correct the spelling...

Is this also a metaphor:

position A and want to get to position Z

like when I have a puzzle and want to go from start to solution:
http://en.wikipedia.org/wiki/Peg_solitaire

I also made a collection AI on www.openprocessing.org

Thank you!

I could not run the code in Processing without map2.bmp

Hi,

Hi,

that's good! I usually use JGraphT to calculate Dijkstra, it works well with Processing. You can find it here. Not so say yours is redundant, but try it out.
After defining a network, you can simply call it like that:

  List<RoadEdge> getRoute (String b, String e) {
    List<RoadEdge> segments = DijkstraShortestPath.findPathBetween(net, b, e);

    return segments;
  }

If you're interested, I can send you the whole sketch, so you  can take a look.

Best,

Marko