summaryrefslogtreecommitdiff
path: root/graph/TSP.cpp
diff options
context:
space:
mode:
authorPaul Jungeblut <s_jungeb@i08pc79.atis-stud.uni-karlsruhe.de>2014-11-26 11:46:02 +0100
committerPaul Jungeblut <s_jungeb@i08pc79.atis-stud.uni-karlsruhe.de>2014-11-26 11:46:02 +0100
commit7a217262958cdf11dfb1f90b86df31acde90ff45 (patch)
tree8d96850058853910ebf2ef75827b0862180fd0c1 /graph/TSP.cpp
parent2c133b76f193478bb85d41a76ae78695cc067452 (diff)
parent24507ee02a8fe20fb22ae30642e3b15e411e82eb (diff)
merge
Diffstat (limited to 'graph/TSP.cpp')
-rw-r--r--graph/TSP.cpp28
1 files changed, 28 insertions, 0 deletions
diff --git a/graph/TSP.cpp b/graph/TSP.cpp
new file mode 100644
index 0000000..c38cbb2
--- /dev/null
+++ b/graph/TSP.cpp
@@ -0,0 +1,28 @@
+//nodes[0] has to be the start and end node.
+vector<vector<int>> dist;
+vector<int> TSP() {
+ int n = dist.size(), m = 1 << n;
+ vector<vector<ii>> dp(n, vector<ii>(m, ii(MAX_N, -1)));
+
+ for(int c = 0; c < n; c++) dp[c][m-1].first = dist[c][0], dp[c][m-1].second = 0;
+
+ for(int v = m - 2; v >= 0; v--) {
+ for(int c = n - 1; c >= 0; c--) {
+ for(int g = 0; g < n; g++) {
+ if(g != c && (((1 << g) & v) == 0)) {
+ if((dp[g][(v | (1 << g))].first + dist[c][g]) < dp[c][v].first) {
+ dp[c][v].first = dp[g][(v | (1 << g))].first + dist[c][g];
+ dp[c][v].second = g;
+ }
+ }
+ }
+ }
+ }
+
+ vector<int> res; res.push_back(0); int v = 0;
+ while(res.back() != 0 || res.size() == 1) {
+ res.push_back(dp[res.back()][(v |= (1 << res.back()))].second);
+ }
+
+ return res;
+}