Просмотр кода страницы Traveling tourist problem

'''Traveling tourist problem''' --- задача о туристе. 

Given a graph <math>G = (V,E)</math>, find the shortest walk visiting a subset of
vertices, such that each vertex is either visited, or has at least one
of its neighbors visited. The vertices of the graph correspond to
monuments the tourist would like to see, and an edge between two
vertices denotes visibility of one monument from another. The shortest
such walk would guarantee that the tourist sees all monuments of
interest.