astar/TravelingSalesman.h

Header of the layer astar, in the group Domains; the same header on the site of Doxygen, its source on GitHub.

Classes

Class	Description
TravelingSalesman	The traveling salesperson problem on at most 32 cities

Description of the header

Header file for the class TravelingSalesman, which implements the Domain concept [see Domain.h] for the traveling salesperson problem with the minimum spanning tree heuristic of exercise 3.30 of Russell and Norvig, “Artificial Intelligence: A Modern Approach” (3rd edition, 2010).

Author

Donato Meoli

Dipartimento di Informatica

Università di Pisa

Copyright