Skip to content

Instantly share code, notes, and snippets.

@JeremyLWright
Forked from raveenb/Screener.md
Last active May 24, 2018 03:20
Show Gist options
  • Save JeremyLWright/b908aaea7a54b91bf1981e9ea21e1f2d to your computer and use it in GitHub Desktop.
Save JeremyLWright/b908aaea7a54b91bf1981e9ea21e1f2d to your computer and use it in GitHub Desktop.

Jon is visiting New York City for the first time. He would like to make use of his stay by touring various places around the city. He wonders if there could be any system which helps him to find a most optimal route which covers as many tourist places as possible from his source to his desired destination point.

Luckily, we have Open Street Maps which contains "tags" on each road describing it. More information about it can be found here, http://wiki.openstreetmap.org/wiki/Elements#Tag.

Now, you as a Software Developer, need to develop a system to solve his problem. Here are the things that will help you,

Using these, when a source and destination points are given, you need to find a route which has a maximum number of tourist places in it. Any of the following tags is considered to be a valid tourist spot.

  • tourism
  • attraction
  • leisure
  • natural

To draw a map, you can use Leaflet library, http://leafletjs.com/ which has OSM support.

We expect you to come up with a simple interactive map where Jon can give his source and destination and get a best possible route to enjoy his stay.

OSM XML file link : https://www.dropbox.com/s/jv0zffxz9blpfq5/map.xml?dl=0

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment