A clever solution to a modified version of Traveling Salesman problem
This solution is not the original solution of the original Traveling Salesman problem. There is a simple modification in which the Salesman can transfer between already visited flagged vertices without any cost.