Although geocoding can be used to map discrete locations with an address, such as coffee shops, it is often the case that geocoding leads to routing. Once you choose the coffee shop that you want to go to, it's then desirable to compute the shortest path so that you can minimize your travel time. Routing is the process of minimizing the distance traveled on a street network. The good news is that routing uses the concept of a task just like the previous tasks we've explored. To compute a route, we're going to use the
RouteTask class. The
RouteTask class will find the shortest or fastest route between two or more locations, called
stops. It goes beyond just traversing the route though. The
RouteTask class will also take into account restricted ...