The Nearest Neighbor Algorithm

Описание к видео The Nearest Neighbor Algorithm

Now that we've defined the Traveling Salesman problem and some of the issues with solving it, we're going to look at a so-called "greedy algorithm" that can (most of the time) get us a good approximation of the least cost path.

Lecture Slides: http://www.whitecraneeducation.com/co...
Facebook:   / whitecraneeducation  

Комментарии

Информация по комментариям в разработке