All Questions
1 question
3
votes
2
answers
2k
views
Shortest path between cities without duplicate calculation (many-to-many)
I have three tables ==> ways, nodes and cities (OpenStreetMap)
ways : Edges with required attributes for routing (source, target, cost, etc.)
nodes : Each and every nodes linking the edges
cities : ...
- 394