Traveling Salesman Problem (TSP) Implementation
Last Updated :
26 Nov, 2024
Given a 2d matrix cost[][] of size n where cost[i][j] denotes the cost of moving from city i to city j. The task is to complete a tour from city 0 (0-based index) to all other cities such that we visit each city exactly once and then at the end come back to city 0 at minimum cost.
Note the difference between Hamiltonian Cycle and TSP. The Hamiltonian cycle problem is to find if there exists a tour that visits every city exactly once. Here we know that Hamiltonian Tour exists (because the graph is complete) and in fact, many such tours exist, the problem is to find a minimum weight Hamiltonian Cycle.
Examples:
Input: cost[][] = [[0, 111], [112, 0]]
Output: 223
Explanation: We can visit 0->1->0 and cost = 111 + 112 = 223.
Input: cost[][] = [[0, 1000, 5000], [5000, 0, 1000], [1000, 5000, 0]]
Output: 3000
Explanation: We can visit 0->1->2->0 and cost = 1000 + 1000 + 1000 = 3000.
Approach:
The given graph is a complete graph, meaning there is an edge between every pair of nodes. A naive approach to solve this problem is to generate all permutations of the nodes, and calculate the cost for each permutation, and select the minimum cost among them.
An important observation in the Traveling Salesman Problem (TSP) is that the choice of the starting node does not affect the solution. This is because the optimal path forms a cyclic tour. For example, if the optimal tour is a1→a2→a3→a4→a1, starting from any other node, such as a2, results in the equivalent tour a2→a3→a4→a1→a2 with same total cost.
To simplify the problem, we can fix one node (e.g., node 1) as the starting point and only consider permutations of the remaining nodes.
C++
// C++ program to find the shortest possible route
// that visits every city exactly once and returns to
// the starting point
#include <bits/stdc++.h>
using namespace std;
int tsp(vector<vector<int>> &cost) {
// Number of nodes
int numNodes = cost.size();
vector<int> nodes;
// Initialize the nodes excluding the fixed
// starting point (node 0)
for (int i = 1; i < numNodes; i++)
nodes.push_back(i);
int minCost = INT_MAX;
// Generate all permutations of the remaining nodes
do {
int currCost = 0;
// Start from node 0
int currNode = 0;
// Calculate the cost of the current permutation
for (int i = 0; i < nodes.size(); i++) {
currCost += cost[currNode][nodes[i]];
currNode = nodes[i];
}
// Add the cost to return to the starting node
currCost += cost[currNode][0];
// Update the minimum cost if the current cost
// is lower
minCost = min(minCost, currCost);
} while (next_permutation(nodes.begin(), nodes.end()));
return minCost;
}
int main() {
vector<vector<int>> cost = {{0, 10, 15, 20},
{10, 0, 35, 25},
{15, 35, 0, 30},
{20, 25, 30, 0}};
int res = tsp(cost);
cout << res << endl;
return 0;
}
// Java program to find the shortest possible route
// that visits every city exactly once and returns to
// the starting point
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
class GfG {
static int tsp(int[][] cost) {
// Number of nodes
int numNodes = cost.length;
List<Integer> nodes = new ArrayList<>();
// Initialize the nodes excluding the fixed starting
// point (node 0)
for (int i = 1; i < numNodes; i++) {
nodes.add(i);
}
int minCost = Integer.MAX_VALUE;
// Generate all permutations of the remaining nodes
do {
int currCost = 0;
// Start from node 0
int currNode = 0;
// Calculate the cost of the current permutation
for (int i = 0; i < nodes.size(); i++) {
currCost += cost[currNode][nodes.get(i)];
currNode = nodes.get(i);
}
// Add the cost to return to the starting node
currCost += cost[currNode][0];
// Update the minimum cost if the current cost
// is lower
minCost = Math.min(minCost, currCost);
} while (nextPermutation(nodes));
return minCost;
}
// function to generate the next lexicographical
// permutation
static boolean nextPermutation(List<Integer> nodes) {
int i = nodes.size() - 2;
// Find the first pair where nodes[i] < nodes[i + 1]
while (i >= 0 && nodes.get(i) >= nodes.get(i + 1)) {
i--;
}
// No next permutation exists
if (i < 0) {
return false;
}
// Find the smallest element larger than nodes[i] to
// the right
int j = nodes.size() - 1;
while (nodes.get(j) <= nodes.get(i)) {
j--;
}
// Swap nodes[i] and nodes[j]
Collections.swap(nodes, i, j);
// Reverse the sequence from i + 1 to the end
Collections.reverse(
nodes.subList(i + 1, nodes.size()));
return true;
}
public static void main(String[] args) {
int[][] cost = { { 0, 10, 15, 20 },
{ 10, 0, 35, 25 },
{ 15, 35, 0, 30 },
{ 20, 25, 30, 0 } };
int res = tsp(cost);
System.out.println(res);
}
}
# Python program to find the shortest possible route
# that visits every city exactly once and returns to
# the starting point
from itertools import permutations
def tsp(cost):
# Number of nodes
numNodes = len(cost)
nodes = list(range(1, numNodes))
minCost = float('inf')
# Generate all permutations of the
# remaining nodes
for perm in permutations(nodes):
currCost = 0
currNode = 0
# Calculate the cost of the current permutation
for node in perm:
currCost += cost[currNode][node]
currNode = node
# Add the cost to return to the starting node
currCost += cost[currNode][0]
# Update the minimum cost if the current cost
# is lower
minCost = min(minCost, currCost)
return minCost
if __name__ == "__main__":
cost = [
[0, 10, 15, 20],
[10, 0, 35, 25],
[15, 35, 0, 30],
[20, 25, 30, 0]
]
res = tsp(cost)
print(res)
// C# program to find the shortest possible route
// that visits every city exactly once and returns to
// the starting point
using System;
using System.Collections.Generic;
using System.Linq;
class GfG {
static int tsp(List<List<int> > cost) {
// Number of nodes
int numNodes = cost.Count;
List<int> nodes = new List<int>();
// Initialize the nodes excluding the fixed starting
// point (node 0)
for (int i = 1; i < numNodes; i++) {
nodes.Add(i);
}
int minCost = int.MaxValue;
// Generate all permutations of the remaining nodes
var permutations
= GetPermutations(nodes, nodes.Count);
foreach(var perm in permutations) {
int currCost = 0;
// Start from node 0
int currNode = 0;
// Calculate the cost of the current permutation
foreach(int node in perm) {
currCost += cost[currNode][node];
currNode = node;
}
// Add the cost to return to the starting node
currCost += cost[currNode][0];
// Update the minimum cost if the current cost
// is lower
minCost = Math.Min(minCost, currCost);
}
return minCost;
}
// Helper function to generate all permutations of a
// list
static IEnumerable<IEnumerable<T> >
GetPermutations<T>(List<T> list, int length) {
if (length == 1)
foreach(var item in list)
yield return new T[] { item };
else
for (int i = 0; i < list.Count; i++) {
var subList = new List<T>(list);
subList.RemoveAt(i);
foreach(var perm in GetPermutations(
subList, length - 1))
yield return new T[] { list[i] }
.Concat(perm);
}
}
static void Main() {
List<List<int> > cost = new List<List<int> >() {
new List<int>{ 0, 10, 15, 20 },
new List<int>{ 10, 0, 35, 25 },
new List<int>{ 15, 35, 0, 30 },
new List<int>
{
20, 25, 30, 0
}
};
int res = tsp(cost);
Console.WriteLine(res);
}
}
// JavaScript program to find the shortest possible route
// that visits every city exactly once and returns to
// the starting point
function tsp(cost) {
// Number of nodes
const numNodes = cost.length;
const nodes = [];
// Initialize the nodes excluding the fixed starting
// point (node 0)
for (let i = 1; i < numNodes; i++) {
nodes.push(i);
}
let minCost = Infinity;
// Generate all permutations of the remaining nodes
const permutations = getPermutations(nodes);
for (let perm of permutations) {
let currCost = 0;
let currNode = 0; // Start from node 0
// Calculate the cost of the current permutation
for (let i = 0; i < perm.length; i++) {
currCost += cost[currNode][perm[i]];
currNode = perm[i];
}
// Add the cost to return to the starting node
currCost += cost[currNode][0];
// Update the minimum cost if the current cost is
// lower
minCost = Math.min(minCost, currCost);
}
return minCost;
}
// Helper function to generate all permutations of an array
function getPermutations(array) {
const result = [];
if (array.length === 1) {
return [ array ];
}
for (let i = 0; i < array.length; i++) {
const current = array[i];
const remaining
= array.slice(0, i).concat(array.slice(i + 1));
const remainingPermutations
= getPermutations(remaining);
for (let perm of remainingPermutations) {
result.push([ current ].concat(perm));
}
}
return result;
}
const cost = [
[ 0, 10, 15, 20 ], [ 10, 0, 35, 25 ], [ 15, 35, 0, 30 ],
[ 20, 25, 30, 0 ]
];
const res = tsp(cost);
console.log(res);
Time complexity: O(n!) where n is the number of vertices in the graph. This is because the algorithm uses the next_permutation function which generates all the possible permutations of the vertex set.
Auxiliary Space: O(n) as we are using a vector to store all the vertices.
Related article:
Similar Reads
Graph Algorithms Graph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Introduction to Graph Data Structure Graph Data Structure is a non-linear data structure consisting of vertices and edges. It is useful in fields such as social network analysis, recommendation systems, and computer networks. In the field of sports data science, graph data structure can be used to analyze and understand the dynamics of
15+ min read
Graph and its representations A Graph is a non-linear data structure consisting of vertices and edges. The vertices are sometimes also referred to as nodes and the edges are lines or arcs that connect any two nodes in the graph. More formally a Graph is composed of a set of vertices( V ) and a set of edges( E ). The graph is den
12 min read
Types of Graphs with Examples A graph is a mathematical structure that represents relationships between objects by connecting a set of points. It is used to establish a pairwise relationship between elements in a given set. graphs are widely used in discrete mathematics, computer science, and network theory to represent relation
9 min read
Basic Properties of a Graph A Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are lines or arcs that connect any two nodes in the graph. The basic properties of a graph include: Vertices (nodes): The points where edges meet in a graph are kn
4 min read
Applications, Advantages and Disadvantages of Graph Graph is a non-linear data structure that contains nodes (vertices) and edges. A graph is a collection of set of vertices and edges (formed by connecting two vertices). A graph is defined as G = {V, E} where V is the set of vertices and E is the set of edges. Graphs can be used to model a wide varie
7 min read
Transpose graph Transpose of a directed graph G is another directed graph on the same set of vertices with all of the edges reversed compared to the orientation of the corresponding edges in G. That is, if G contains an edge (u, v) then the converse/transpose/reverse of G contains an edge (v, u) and vice versa. Giv
9 min read
Difference Between Graph and Tree Graphs and trees are two fundamental data structures used in computer science to represent relationships between objects. While they share some similarities, they also have distinct differences that make them suitable for different applications. Difference Between Graph and Tree What is Graph?A grap
2 min read
BFS and DFS on Graph
Breadth First Search or BFS for a GraphGiven a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Depth First Search or DFS for a GraphIn Depth First Search (or DFS) for a graph, we traverse all adjacent vertices one by one. When we traverse an adjacent vertex, we completely finish the traversal of all vertices reachable through that adjacent vertex. This is similar to a tree, where we first completely traverse the left subtree and
13 min read
Applications, Advantages and Disadvantages of Depth First Search (DFS)Depth First Search is a widely used algorithm for traversing a graph. Here we have discussed some applications, advantages, and disadvantages of the algorithm. Applications of Depth First Search:1. Detecting cycle in a graph: A graph has a cycle if and only if we see a back edge during DFS. So we ca
4 min read
Applications, Advantages and Disadvantages of Breadth First Search (BFS)We have earlier discussed Breadth First Traversal Algorithm for Graphs. Here in this article, we will see the applications, advantages, and disadvantages of the Breadth First Search. Applications of Breadth First Search: 1. Shortest Path and Minimum Spanning Tree for unweighted graph: In an unweight
4 min read
Iterative Depth First Traversal of GraphGiven a directed Graph, the task is to perform Depth First Search of the given graph.Note: Start DFS from node 0, and traverse the nodes in the same order as adjacency list.Note : There can be multiple DFS traversals of a graph according to the order in which we pick adjacent vertices. Here we pick
10 min read
BFS for Disconnected GraphIn the previous post, BFS only with a particular vertex is performed i.e. it is assumed that all vertices are reachable from the starting vertex. But in the case of a disconnected graph or any vertex that is unreachable from all vertex, the previous implementation will not give the desired output, s
14 min read
Transitive Closure of a Graph using DFSGiven a directed graph, find out if a vertex v is reachable from another vertex u for all vertex pairs (u, v) in the given graph. Here reachable means that there is a path from vertex u to v. The reach-ability matrix is called transitive closure of a graph. For example, consider below graph: GraphTr
8 min read
Difference between BFS and DFSBreadth-First Search (BFS) and Depth-First Search (DFS) are two fundamental algorithms used for traversing or searching graphs and trees. This article covers the basic difference between Breadth-First Search and Depth-First Search.Difference between BFS and DFSParametersBFSDFSStands forBFS stands fo
2 min read
Cycle in a Graph
Detect Cycle in a Directed GraphGiven the number of vertices V and a list of directed edges, determine whether the graph contains a cycle or not.Examples: Input: V = 4, edges[][] = [[0, 1], [0, 2], [1, 2], [2, 0], [2, 3]]Cycle: 0 → 2 → 0 Output: trueExplanation: The diagram clearly shows a cycle 0 → 2 → 0 Input: V = 4, edges[][] =
15+ min read
Detect cycle in an undirected graphGiven an undirected graph, the task is to check if there is a cycle in the given graph.Examples:Input: V = 4, edges[][]= [[0, 1], [0, 2], [1, 2], [2, 3]]Undirected Graph with 4 vertices and 4 edgesOutput: trueExplanation: The diagram clearly shows a cycle 0 → 2 → 1 → 0Input: V = 4, edges[][] = [[0,
8 min read
Detect Cycle in a directed graph using colorsGiven a directed graph represented by the number of vertices V and a list of directed edges, determine whether the graph contains a cycle.Your task is to implement a function that accepts V (number of vertices) and edges (an array of directed edges where each edge is a pair [u, v]), and returns true
9 min read
Detect a negative cycle in a Graph | (Bellman Ford)Given a directed weighted graph, your task is to find whether the given graph contains any negative cycles that are reachable from the source vertex (e.g., node 0).Note: A negative-weight cycle is a cycle in a graph whose edges sum to a negative value.Example:Input: V = 4, edges[][] = [[0, 3, 6], [1
15+ min read
Cycles of length n in an undirected and connected graphGiven an undirected and connected graph and a number n, count the total number of simple cycles of length n in the graph. A simple cycle of length n is defined as a cycle that contains exactly n vertices and n edges. Note that for an undirected graph, each cycle should only be counted once, regardle
10 min read
Detecting negative cycle using Floyd WarshallWe are given a directed graph. We need compute whether the graph has negative cycle or not. A negative cycle is one in which the overall sum of the cycle comes negative. Negative weights are found in various applications of graphs. For example, instead of paying cost for a path, we may get some adva
12 min read
Clone a Directed Acyclic GraphA directed acyclic graph (DAG) is a graph which doesn't contain a cycle and has directed edges. We are given a DAG, we need to clone it, i.e., create another graph that has copy of its vertices and edges connecting them. Examples: Input : 0 - - - > 1 - - - -> 4 | / \ ^ | / \ | | / \ | | / \ |
12 min read