I need to convert a .osm file to graph in adjacency list format. I will also need to output the shortest path between two nodes (I need to include all the nodes in order from the source to destination node). More details in PDF. Also, Java knowledge alone is not enough, Spark knowledge needed as the program needs to be able to run for <20 min.
Dear Client.
OSM file is a very large file, so after getting graph from osm file, it needs to use Spark GraphX for finding shortest path, i think.
I hope your kind reply for further discussing on this project.
Thanks.