Drawing heavily on academic knowledge this book almost requires a degree in civil engineering before you even start reading. This is a book for the expert rather than the novice.
This tutorial was developed by Jan Husdal at the University of Utah, Salt Lake City, 2000-2002. It shows how to solve 3 categories of network analysis problems; Find Best Route, Find Closest Facility and Find Service Area, and it comes complete with exercise data and solutions.
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.
This book tells you the difference between the various types of graphs, trees and networks and shows you step by step calculations on how to solve them by hand (they didn’t have that many computers in 1993).
Traditionally, network analysis, path finding and route planning have been the domain of graph theory and vector GIS, which is where most algorithms find their application. Contrary to such common wisdom, the research of this thesis for the Msc in GIS explores the topic of network analysis in raster GIS, using MFworks as example software.
This research essay and literature review investigates some of the gateways to path finding in static and dynamic networks that are listed in present research literature. A selected set of different approaches are highlighted and set in a broader context, illustrating the various aspects of path finding in static and dynamic networks.
The key to producing successful network models is in understanding the relationship between the characteristics of physical network systems and the representation of those characteristics by the elements of the network model.
