Our computer system gives driving directions, solving the shortest path problem in a graph which represents a real street map. With the aid of a machine-readable set of business listings, it can recommend driving routes between locations specified as: (1) Numerical street addresses, e. g. '600 Mountain Ave. , 07974'. (2) Street intersections, e. g. 'Mountain Ave. and South St. ' (3) Named individuals or businesses, e. g. 'the Lackawanna Diner. ' (4) The closest business of a given type, e. g. 'Nearest barber. ' We describe the data storage and organization used to represent large and detailed street maps. Our map of the New York - New Jersey metropolitan area, for example, has as a graph 245,000 nodes and 358,000 edges, and occupies 30 megabytes.
|Original language||English (US)|
|Number of pages||5|
|Journal||Proceedings of the National Electronics Conference|
|State||Published - 1984|
All Science Journal Classification (ASJC) codes