Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with
or
.
Download ZIP
Solve Travelling Salesman Problem in oF (primarily by brute force)
C++
branch: master

Fetching latest commit…

Cannot retrieve the latest commit at this time

Failed to load latest commit information.
ofxTSP-RouteFinderExample
ofxTSP-example
ofxTSPLib
src
.gitignore
readme.md
screenshot.png

readme.md

Introduction

The Travelling Salesman Problem is a computational problem of finding the 'shortest route' between a set of nodes

Usage

Define your problem with the class ofxTSP::Problem :

    struct Problem {
        int destinationCount;
        map<Journey, float> distance;
    };

wherein an ofxTSP::Journey is defined as:

    struct Journey {
        uint16_t start;
        uint16_t end;
    };

Then apply a ofxTSP::Solver using the function:

vector<int> solve(const Problem & problem)

The returned vector<int> has ordered elements which define the route

Currently the only available solver is ofxTSP::BruteForce as i've got a pretty simple problem here. Others will come later as necessary.

Something went wrong with that request. Please try again.