Java Programming

Hi�

I�m trying to make a simple route-planner which will find the shortest route from start to end, through some points (a route-planner like the GPS-systems uses).

I have looked at Dijkstra's algorithm, but isn�t that just for finding the shortest route between a start and a end point?

An example of what I�m talking about is this:
http://www.scorp-d.dk/Route.jpg
Find the shortest route from start to end through points A, I and O.

Does there exist some kind of algorithm to calculate this or is there another way around?

Scorp-D