+ gtfs:
	+ use csv parser to parse csv file
	+ parse the calendar.tct and look for the service-ids which have
wednesday set to 1
	+ store the service-ids in a hashset
	+ parse the trip.txt and store the trips with a service-id contained in
service-ids
	+ parse the stops and add them as nodes to graph
	+ parse the stop_times and add arcs and nodes
	+ add transit nodes
	+ add nodes to nodesToStation
	+ add boarding and waiting arcs
	+ unit test for generate id
	+ unit test for getting id,time,nodetype
	+ unit test for sorting the station nodes
	+ unit test for adding boarding and waiting arcs
	+ test on manathan and check if correct graph is contructed
	+ add interface timexpandend and add method compute shortest path with
time
	+ make timeexapnded dijkstra which extends dijkstra
	+ make separate stop condition which extracts the stationid from the
min node and checks if equal to node
	+ get the nearest node to the time and station id and use as source
	+ unit test select nearest node
	+ extend experiment class to select random time and random station
	+ select random station id and random time