[pgrouting-users] All Nearest Neighbors

[Brian DeRocher]

Does pgrouting have an algorithm to solve All Nearest Neighbors.  I'd rather not run Dijkstra's or A* n times.

I'm working on a project of build US congressional districts based on a k-means clustering of citizen residences.  But i want to use the driving distance for the distance function.  This is like asking, what's the closest post office for every person.  It's more work than A*, but it seems to me, less work than all pairs shortest path.  Am i wrong?

http://en.wikipedia.org/wiki/Nearest_neighbor_search#All_nearest_neighbors

If not, i'll work on it, where's a good place to start.

Brian

-- 
http://brian.derocher.org
http://mappingdc.org
http://about.me/brian.derocher