CHAPTER 11The Routing Engine
Using the techniques described in Chapter 10, you know how to obtain the shortest path between two network nodes. The result of the search was a logical path, or a list of links traversed. You could also get the geographical path, or the geometry of the path.
Let's assume you want to tell a customer how to get to your nearest store. Using the Network Data Model shortest-path search, you received the geometry of the path. You can use it to show the shortest route to your store on a map.
But this can be hard to read and hard to use. It would be better if you could also tell your customer ...