Current research work into establishing a performance efficiency hierarchy between Java, C++ and ArcView is described and experimentation is performed in order to statistically compare shortest path query execution time, response time and implementation issues.
GISRUK 2002
This is co-authored paper presented at GISRUK 2002, University of Sheffield, Sheffield, UK, 3-5 April 2002
Read online
Reference
Sherlock, R., Moone, P., and Winstanley, A. (2002) Shortest Path Computation: A Comparative Analysis. Paper presented at GISRUK 2002, University of Sheffield, Sheffield, UK, 3-5 April 2002
More from husdal.com
If you are into network analysis of any kind, this book teaches you the basics. As the name impl ...
This tutorial was developed by Jan Husdal at the University of Utah, Salt Lake City, 2000-2002. ...
Euler’s famous “Königsberg bridge” question, dating back as far as 1736, is often seen as the st ...
This research essay and literature review investigates some of the gateways to path finding in s ...
Transportation networks are exposed to a wide range of natural hazards and this study has devel ...






















2010/09/02: Book Review: Risk Modeling, Assessment, and Management
2010/08/28: Importance and Exposure – Measures of Road Network Vulnerability?
2010/08/27: Logipi – why you should listen to it
2010/08/26: The ISCRIM Newsletter 1/2010
2010/08/25: Blog Supply Chain Risk: Writer’s Block
2010/08/24: Next time in China: Guanxi
2010/08/23: Supply Chain Risk: Culture Shock
2010/08/04: Book Review: Humanitarian Logistics
2010/07/11: WCTR 2010