R. J. Elliott, M. E. Lesk

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations


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 languageEnglish (US)
Pages (from-to)625-629
Number of pages5
JournalProceedings of the National Electronics Conference
StatePublished - 1984
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Engineering(all)


Dive into the research topics of 'DATA STRUCTURES FOR STREET MAPS.'. Together they form a unique fingerprint.

Cite this