[pgrouting-dev] pgrouting Dijkstra: non-vertex data routing

[Yang Zhang]

Hello everyone,

I have some data samples, they are some traffic accident locations (have
shape files) I really want to use the dijkstra function of pgrouting to
look into their shortest distances between each other. However, I noticed
that dijkstra requires all the points need to be the vertices of a
topology. But obviously my data points are not the vertices of the road
network. Is there any way to integrate my data points to the road network
and make them vertices too? What is the good approach to route non-vertex
data like this?
-- 
Yang Zhang
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.osgeo.org/pipermail/pgrouting-dev/attachments/20150722/20e190f9/attachment.html>