Todays Challenge #codepunt : Shamil ,who works with Albery as sales man every week is given a target of meeting doctors located in different cities. Write a program to help him plan his itinerary such that he completes his tour in shortest time, visits each city exactly once and return s to Cairo from where he starts his tour. He is also given the distance between each pair of cities that he needs to visit. Input: List of cities and distance for each pair. i.e. Cities: London, Sydney Distance between Cairo & London, Cairo & Sydney, Sydney & London Output: Shortest route between Cairo, London and Sydney such that Shamil starts from Cairo and finishes at Cairo and visits London and Sydney once and only once.
Posted on: Mon, 25 Aug 2014 11:22:47 +0000