Skip to main content

All Questions

Tagged with
Filter by
Sorted by
Tagged with
3 votes
1 answer
237 views

How to improve shortest path results with Dijkstra/A* on a hexagonal mesh

I am working with traversable polygons and need to calculate the shortest path across them. To do this, I generated a hexagonal mesh over the polygons, extracted the edges, and applied both Dijkstra ...
BR75's user avatar
  • 497
1 vote
1 answer
114 views

Incorrect Shortest Paths

I compute shortest paths between ports. However, some of the resulting paths are simply incorrect. Consider the following example where coast is multi-polygon object of the planet's landmass (e.g. ...
user's user avatar
  • 298
2 votes
0 answers
694 views

Using shortest path pgr_dijkstra

Versions PostGIS Bundle 3 for PostgreSQL x64 12 pgAdmin 4.24 pgrouting 3.1.0 I have also enabled the postgis and pgrouting extensions on a public schema. I am only just starting with pgrouting so I am ...
pauldanc's user avatar
1 vote
0 answers
140 views

Memory efficient shortest path algorithm for offline Android app [closed]

Finding the shortest path in a road network requires the road network to be loaded up in memory. Using Dijkstra's algorithm, for example, it searches through all the immediate road coordinates and ...
user134132523's user avatar
4 votes
1 answer
680 views

Dijkstra/Finding shortest path gives back a tree with only -1 in it

So I'm trying to implement a routing algorithm in my QGIS 3 plugin that I'm writing using Python. I think I could resolve all the problems concerning the break between QGIS 2 and 3, but my resulting ...
user125606's user avatar
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 : ...
BFlat's user avatar
  • 394
1 vote
1 answer
517 views

pgr_Dijkstra: iterate/loop through a table with multiple OD pairs one-by-one

I have a table with 2 columns: column A with the startvertex and column B with endvertex. How can I do a OD pairs shortest path? It is with a loop I suppose, but how can this loop be implemented ...
ledobbel's user avatar
3 votes
0 answers
504 views

Route between two point layers following streets

I have a problem to be solved with shortest path route. What I have: layer 1 with startpoints layer 2 with endpoints layer 3 with streets (lines) These two point layers are originally the start ...
ledobbel's user avatar
1 vote
1 answer
272 views

Typing path length using shortest path dijkstra()

I am now trying to get the length of a shortest path using dijkstra(). I need it to find all the points in my sample, which are located more than 25 km away along roads from district centres. I will ...
Mikhail Malashenko's user avatar
0 votes
1 answer
1k views

Making dijkstra algorithm Shortest Path with ArcGIS for Desktop?

I am new user of ArcGIS. I have some basic knowledge such as, add data as layers, find and download map as my related study, I am also familiar with common tools in ArcGIS like joining and selection ...
Syaifur Rohman's user avatar
0 votes
0 answers
56 views

Pgrouting (QGIS) multiple point [duplicate]

I have read al lot of the pgrouting, but i still not quite sure if it can do what i want. I have 20 stop points and i have 1 starting point and 1 finish point. I want to calculate the shortest path ...
Elmalle Pietje's user avatar