pgRouting extends the PostGIS / PostgreSQL geospatial database to provide shortest path search and other network analysis functionality.

This presentation will show the inside and current state of the pgRouting development, from its wide range of shortest path search algorithms and other algorithms like driving distance calculation or “Traveling Sales Person” (TSP) optimization, graph contraction, flow analysis etc. Additionally we will give a brief outlook and introduction of upcoming new features on the version 3.0.

We will explain how the data structure is important to get better routing results. Furthermore we will show how you can improve the quality of the search with dynamic costs and make the result look closer to the reality. You will also learn about difficulties and limitations of the library, and when pgRouting might not be not the right tool to solve your routing problem.