GIS coaching for territorial management.
We have discussed in previous articles how to set up the network data for pgrouting and how to develop a wrapper to search the route between two points. Here we will discuss how to set up…
Read More
A wrapper is a PostgreSQL function that contains pgRouting and PostGIS features easier to use than pgRouting and PostGIS functions straightaway. The pgRouting native functions have been designed to be generic so they can be used…
Read More
pgRouting includes a function called pgr_drivingDistance , that, together with three others functions , pgr_withPointsDD , pgr_alphaShape and pgr_pointsAsPolygon , can be used to establish which paths have a certain cost versus a starting or arrival…
Read More
The pgrouting extension offers various algorithms to find the best route: Dijkstra, A *, Ksp, Trsp, … In this article we will discuss in detail the use of a * (A-star). We will continue to use…
Read More
Here starts a series of articles to set up a routing web application (route calculation) completely autonomous, ie using no web service or API for calculating the route. We will set up the database including the…
Read More
Given a graph and a source vertex in the graph, Dijkstra’s algorithm finds the shortest paths from source to all vertices in the given graph. It takes as input an oriented graph weighted by real positive…
Read More