# Tagged Questions

A* is a graph shortest-path algorithm that uses a heuristic function to speed up the search

145 views

### Accelerating python looping process for A-star path finding on DEM surface?

I try to make an A-star Path Finding program base on tile-graph (image raster data as graph) where each pixel values represent as cost and elevation.. In my case, DEM raster data was called by using ...
467 views

### Convert Road layer shapefile into a graph

I'm going to use Astar algorithm to find a path between two selected points.And I used the following code for that.Is there any way I could convert my Road Layer shapefile into a graph, which can be ...
453 views

### Does not show shortest path in networkx (in QGIS)

I used the following commands (in qgis console) to get the shortest path with astar algorithm. But the result shows 'NetworkXNoPath' every time. Why was that? Please help me to find a solution to this ...
305 views

### Development guide for beginner? [duplicate]

Im new to GIS and mapping, and I need to learn how to create web map application for my project. I'm really confused on what to use. I have read PostGIS, OpenStreetMap, and Openlayer. I'm wondering ...
117 views

### How to add nodes into graph

I'm new to qgis and in here I want to find a path between two selected points on the map(Roads-vector layer). The points are selected by the user, using mouse clicks. So here I used the astar ...
571 views

### pgRouting 2.0 slow execution of A star algorithm

Recently, I wanted to test pgRouting ver. 2.0. I created the database structure with osm2po and imported UK map from geofabrik. The data was imported correctly. When I execute a sample query in ...
28 views

### Is it possible to calculate the route when source and destination having same junction using A* algorithm?

I am using A* Algorithm to calculate the shortest path. The route was calculated based on the junction. Shortest route was calculated when there was two or more junction in between source and ...
391 views

### Python/GDAL: Best way to read in raster for use in A* search algortihm

I want to create a least cost path program with Python and GDAL since I couldn't find any open source cost path additions for use in Python. As recommended here the best approach is to use A* search ...
314 views

### How to correctly convert data from OSM with osm2po to use it with A* algorithm?

I want to make my A-Star fast, by using heuristics. At the moment it is very slow and even slower than my Dijkstra. I thougt A-Star is in the worst case as fast as Dijkstra. I convert my OSM bounding ...