Third Party Resources and Writing functions - pgRouting/pgrouting GitHub Wiki

pgRouting Gist code list your pgRouting function(s), and share, discuss and improve them with others.

Click to Add a Gist and modify this wiki and add your Gist to the list. (most recent at top) The date of inclusion to this wiki.

Users shared Gist code

date	title	author	topic
Jul 8, 2016	pgrw_xyroute.sql	@worthlutz	is an example of a wrapper around the pgr_trsp function to require only x/y inputs for source and target points. Routing is then done by pgr_trsp using the nearest location on the closest edges to the source and target points. To achieve this result, the details of the specific routing network are hard-coded as constants in the wrapper. Modification to your specific situation should be simple.
Aug 31, 2013	pgr_graphviz.sql	Stephen Woodbridge	Function that will read an edge table and generate output suitable as input to graphviz that can generate graphical plots of your graph.
Aug 1, 2013	TSP and ATSP functions	Dave Potts.	These functions provide some tools for solving Asymmetric TSP problems, utilities for building and check distance matrices.
Nov 13, 2013	pgrouting dijksta travelling salesman problem tsp with openstreetmap	Michael Tischer	Traveling Salesman Problem

Friends of pgRouting

This section list links to other sites that provide tools that work with pgRouting or provide enhancements to pgRouting that others have developed and are not part of the core product.

date	Repository	topic
Dec 9, 2014	OSRM-Tools	is a set of tools that allow you to connect pgRouting with the OSM routing engine. OSRM is a high performance routing engine that focuses on speed over configurability. OSRM-Tools provides tools to migrate data from pgRouting to OSRM (this tool is a little dated because OSRM does not supply a stable or documented API for this) and wrapper functions to access an OSRM route server from postgresql.
Dec 6, 2013	networkReach	is a function using the core pgr_drivingDistance() function that will return all edges within a cost distance, along with partial edges where the cost goes beyond a node but not all the way to the next node.