title: Pathfinding (routing, trip planning, ...) algorithms on graphs with time restrictions
body: <p>I have a database of bus/train/... stops and the arrival/departure times on each date and so on. I'm looking for a way to do a search for the fastest(shortest/cheapest/least transitions) trip between two locations. I would like to have arbitrary locations in the future, using OpenStreetMap data to do walking between stops and from stops to start/end, however for the time being I just want to find path between two stops in the database.</p>
  
  <p>The problem is I can't seem to find much info about this subject, for example <a href="http://en.wikipedia.org/wiki/Journey_Planner" rel="noreferrer">this Wikipedia page</a> has a lot of text with absolutely no useful information in it.</p>
  
  <p>What I've found is the <a href="http://code.google.com/intl/sk-SK/transit/spec/transit_feed_specification.html" rel="noreferrer">GTFS</a> format, used in <a href="http://www.google.com/intl/sk/landing/transit/#dmy" rel="noreferrer">Google Transit</a>. While my city doesn't provide a public data feed (not even a private one), I already have all the important information that the GTFS contains and making a transformation would be trivial.</p>
  
  <p>There is some GTFS-based software, like like <a href="http://opentripplanner.org/" rel="noreferrer">OpenTripPlanner</a> that can also do pedestrian/car/bike routing using <a href="http://www.openstreetmap.org/" rel="noreferrer">OpenStreetMap</a>.</p>
  
  <p><em>However</em>, the routing code isn't well documented (at least from I've found) and I don't need the whole thing.</p>
  
  <p>All I'm looking for is some good overview of the algorithms I could use, their performance, maybe some pseudocode.</p>
  
  <p>So, <strong>the question is</strong>, given a list of stops, routes and arrival/departure/travel times, how can I easily find the fastest path from stop A to stop B?</p>