0

I have this requirement. Where I have to create one application that will save the following data ( Source City, Destination City, travel time) as one record and I have the option to save this in any DB I want(Relational, NoSQL, graph based).

Now user can query the application by giving the source and destination city and I have to find the shortest path in terms of minimum connection and shortest path in terms of minimum time for the given source and destination.

Can anyone please help how can I implement this logic at DB level, because even If I think of implementing this using Dijkstra's algorithm in java. I will have to fetch all the records from the DB to create the graph every time user makes a new search.

Any help in terms of approach/logic will help. Thanks

Naveen Handa
  • 75
  • 2
  • 11
  • One way to do it is to calculate all pair short path and save the two dimensional matrix. – Amit Vikram Singh Jul 26 '18 at 08:08
  • Why would you like to store the graph in a DB? Here you can find other alternatives when possible: https://stackoverflow.com/questions/49612663/is-there-any-other-data-structure-to-represent-graph-other-than-adjacency-list-o/ – FrankS101 Jul 27 '18 at 16:45

0 Answers0