Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

(Ovid - zip code distance) Re: Algorythym for searching closest neighbor

by Ovid (Cardinal)
on Apr 03, 2001 at 16:42 UTC ( [id://69280]=note: print w/replies, xml ) Need Help??


in reply to Algorythym for searching closest neighbor

If you're looking for the closest neighboring zip code (as opposed to two zip codes that closely match), you really have no guarantee that two zips that are close to one another numerically are going to suit your needs.

This thread has info about determining how far apart two zip codes are. There's even some sample code for you.

Cheers,
Ovid

Join the Perlmonks Setiathome Group or just click on the the link and check out our stats.

  • Comment on (Ovid - zip code distance) Re: Algorythym for searching closest neighbor

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://69280]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others wandering the Monastery: (4)
As of 2024-04-25 05:29 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found