Can anybody tell me, how to store and present graph in this problem??? There are too much edges and vertexes.

there are in total not more than 200000 numbers in the N lines describing the routes

ML is 32 Mb - so you have approx 160 bytes per pair <bus route, bus stop>. More than enough if every vertex contains list of edges/adjacent vertices.