{"version":"1.0","type":"link","title":"Nearest neighbour algorithm - Newikis","description":"Nearest neighbour algorithms is the name given to a number of greedy algorithms to solve the problems related to graph theory. This algorithm was made to find a solution to the travelling salesman problem. In general, these algorithms try to find a Hamlitonian cycle as follows:","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}