Algorithms_in_C++ 1.0.0
Set of algorithms implemented in C++.

[Travelling Salesman Problem] (https://en.wikipedia.org/wiki/Travelling_salesman_problem) implementation More...
#include <algorithm>
#include <cassert>
#include <iostream>
#include <limits>
#include <vector>
Namespaces  
namespace  graph 
Graph Algorithms.  
Functions  
int  graph::TravellingSalesmanProblem (std::vector< std::vector< uint32_t > > *cities, int32_t src, uint32_t V) 
Function calculates the minimum path distance that will cover all the cities starting from the source.  
static void  tests () 
Selftest implementations.  
int  main () 
Main function.  
[Travelling Salesman Problem] (https://en.wikipedia.org/wiki/Travelling_salesman_problem) implementation
Travelling salesman problem asks: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? TSP can be modeled as an undirected weighted graph, such that cities are the graph's vertices, paths are the graph's edges, and a path's distance is the edge's weight. It is a minimization problem starting and finishing at a specified vertex after having visited each other vertex exactly once. This is the naive implementation of the problem.
int main  (  void  ) 
Main function.

static 
Selftest implementations.