[R-sig-Geo] Shortest network path distances

[Dan Bebber]

Dear Taka,

Anything is possible on R!
I do all my shortest path calculations with RBGL and graph packages from
Bioconductor.
RBGL (based on the C++ Boost Graph Library) has several shortest path
algorithms that perform better on graphs of different types.
I usually use the johnson.all.pairs.sp() function
http://www.bioconductor.org/packages/release/GraphsAndNetworks.html


Yours,
Dan Bebber
_________________________________________
Dr Daniel P Bebber, MA, DPhil
 
Head of Climate Change Research
Earthwatch Institute
 
Junior Research Fellow in Biology
St. Peter's College, University of Oxford
 
Earthwatch Institute (Europe)
267 Banbury Road
Oxford OX2 7HT
UK
T. +44(0)1865 318842
F. +44(0)1865 311383
dbebber at earthwatch.org.uk
www.earthwatch.org


On Thu, 13 Sep 2007, Takatsugu Kobayashi wrote:

> Hi,
>
> I would like to know if there are packages to compute shortest network
> path distances, something that can be down on TransCAD and ArcGIS
> network analyst. I have cencus tract centroids and network line
> shapefiles for 126 US urbanized areas. Basically, I would like to move
> the census tract centroids a bit to see how much it changes the shortest
> path distances.