finding the best route between two stations in the subway (underground)

Hello,

I am trying to find a good algorithm for finding the best route between two stations on a subway transport system such as the London Underground. I have managed to read up on an algorithm called the breadth first search which is adapted to do this taks by using extra parameters such as time btween stations and time it takes to change station at an interchange stations.

I am wondering if any of you know how to best tackle this problem. With linked lists of threads? Also, are there any open source java algorithms that do such thing. The assignement I am working on is not just finding the best route. It is part of it.

Thanks!

[663 byte] By [HeshamGGa] at [2007-9-29 17:58:56]