Make a Donation

Support pgRouting with some donation! Read more about how your donation will help the project.


pgRouting Project

pgRouting Project

pgRouting extends the PostGIS / PostgreSQL geospatial database to provide geospatial routing functionality.

Advantages of the database routing approach are:

  • Data and attributes can be modified by many clients, like QGIS and uDig through JDBC, ODBC, or directly using Pl/pgSQL. The clients can either be PCs or mobile devices.
  • Data changes can be reflected instantaneously through the routing engine. There is no need for precalculation.
  • The “cost” parameter can be dynamically calculated through SQL and its value can come from multiple fields or tables.

Core Features

pgRouting provides functions for:

  • All Pairs Shortest Path, Johnson’s Algorithm [1]
  • All Pairs Shortest Path, Floyd-Warshall Algorithm [1]
  • Shortest Path A*
  • Bi-directional Dijkstra Shortest Path [1]
  • Bi-directional A* Shortest Path [1]
  • Shortest Path Dijkstra
  • Driving Distance
  • K-Shortest Path, Multiple Alternative Paths [1]
  • K-Dijkstra, One to Many Shortest Path [1]
  • Traveling Sales Person
  • Turn Restriction Shortest Path (TRSP) [1]
  • Shortest Path Shooting Star [2]

Learn more about using pgRouting in your application by reading the documentation.

[1] New in pgRouting 2.0.0
[2] Discontinued in pgRouting 2.0.0

pgRouting is Open Source

pgRouting is available under the GPLv2 license and is supported by a growing community of individuals, businesses and organizations.