Implemented Agenda-based search methods to buid an AI route finder. The data is taken from CSV file which defines london tube map. Following methods are used to find routes from starting station to a destination station:

• DFS
• BFS
• UCS

Cost function is extended by adding time required between the stations. Heuristic search is also implemented on the knowledge of the zone and how to use that to give optimal route with least amount of tube line changes.