title: timetable implementation with Dijkstra's Algorithm
body: <p>I'm trying to implement a system of reading coach timetables to plan a journey.  </p>
  
  <p>Here's my scenario:<br>
  I'd like to just enter a travel date, a start station and an end station, but to get from A to B, there could be 3 or 4 connecting journeys involved, and I'd like to return several options, ordered by total time required.  My database set up has a table for stations, a table for journeys and a table for journey instances (i.e. containing inclusive dates of operation of journeys).</p>
  
  <p>I've got a good implementation in c# of Dijkstra's algorithm, but I find it's limited as I can't figure out how to include time for waiting at bus stations for connecting journeys, and the fact that many journeys can go from one station to another at different times is adding to the confusion.  I also have to take into account if the journey takes a day or even 2 to complete, which has proved troublesome.  Is Dijkstra's worth persevering with here, or does anyone know of something else that might be better suited?</p>
  
  <p>I'm using asp.net MVC3, C# and EF4, but it's not so much code I'm after here - more just a point in the right direction of the process I'd be best using, as this is well beyond anything I've done before. (I possibly bit off more than I could chew when I volunteered for this project!) If anyone could offer some advice, or a link to some documentation that could help with this situation, that would help enormously.  Thanks</p>