Prepare Neo4j database of airline airports and routes. Implement Dijkstra algorithm to evaluate shortest path for flights with available seats.
I'm need a developer with Neo4j/graph database experience to create Neo4j database of airports, airlines and routes connected together.
List of airports, routes and airlines will be provided.
You will require implementing Deikstra algorithm for the shortest path search of available flights with couple of filters (airline rating, sort by shortest travel time, alliance). As far as I know shortest path algorithms (deijkstra and A*) are already packaged into Neo4j, so you it could be pretty easy to call.
Final product can have simple console where I will enter destination/ origin airport, date and click search. Results will include shortest path routing.
Skills required:
Java, Mongo and NoSQL Couch