Practical shortest distance datastructure

This post has been de-listed

It is no longer included in search results and normal feeds (front page, hot posts, subreddit posts, etc). It remains visible only via the author's post history.

Post Body

If you wanted to know the shortest distance/path between two household addresses, which data structure(s) would you use to return the answer efficiently?

Say you are considering the set of all households in the United States (~100 million).

I am struggling to come up with a practical data structure considering the input size is so big. Dijkstra's seems too inefficient, but I'm guessing there is a way to preprocess the paths to make such a query possible. I just don't know where to start.

Thanks in advance for any advice.

Author

Account Strength

100%

Account Age

13 years

Verified Email

Yes

Verified Flair

Total Karma

6,759

Link Karma

2,445

Comment Karma

3,694

Profile updated: 3 hours ago

Posts updated: 3 weeks ago

Lasker_

Subreddit

r/algorithms

Post Details

We try to extract some basic information from the post title. This is not always successful or accurate, please use your best judgement and compare these values to the post title and body for confirmation.

Posted: 10 years ago
Reddit URL: View post on reddit.com
External URL: reddit.com/r/algorithms/...