tsp_brute, a C++ code which solves small versions of the traveling salesman problem (TSP), using brute force.

The user must prepare a file beforehand, containing the city-to-city distances. The program will request the name of this file, and then read it in. An example of such a file is:

        0  3  4  2  7
        3  0  4  6  3
        4  4  0  5  8
        2  6  5  0  6
        7  3  8  6  0


The computer code and data files described and made available on this web page are distributed under the MIT license


tsp_brute is available in a C version and a C++ version and a FORTRAN90 version and a MATLAB version and a Python version.

Related Data and Programs:


change_making, a C++ code which considers the change making problem, in which a given sum is to be formed using coins of various denominations.

combination_lock, a C++ code which simulates the process of determining the secret combination of a lock.

knapsack_01, a C++ code which uses brute force to solve small versions of the 0/1 knapsack problem;

partition_problem, a C++ code which seeks solutions of the partition problem, splitting a set of integers into two subsets with equal sum.

satisfy, a C++ code which demonstrates, for a particular circuit, an exhaustive search for solutions of the circuit satisfiability problem.

subset_sum, a C++ code which seeks solutions of the subset sum problem.

tsp, a dataset directory which contains test data for the traveling salesperson problem;


  1. Gerhard Reinelt,
    TSPLIB - A Traveling Salesman Problem Library,
    ORSA Journal on Computing,
    Volume 3, Number 4, Fall 1991, pages 376-384.

Source Code:

Last revised on 06 May 2020.