Last active
August 29, 2015 14:22
-
-
Save Acarus/5ea63be5c9ac3afca28e to your computer and use it in GitHub Desktop.
Discrete Mathematics. Laboratory work №8.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
#include <stdio.h> | |
#include <vector> | |
#include <stdlib.h> | |
#include <math.h> | |
#include <iomanip> | |
#include <algorithm> | |
using namespace std; | |
inline float cartesianDistance(pair< float, float > a, pair< float, float> b) { | |
return sqrt(pow(a.first - b.first, 2) + pow(a.second - b.second, 2)); | |
} | |
void solve(vector< vector< float > >& g, vector< bool >& used, vector< int >& path, float& value, int start, int v) { | |
used[v] = true; | |
path.push_back(v + 1); | |
if(path.size() == g.size()) { | |
value += g[v][start]; | |
path.push_back(start + 1); | |
return; | |
} | |
int min_index = -1; | |
for(int i = 0; i < g.size(); i++) | |
if((v != i && !used[i]) && (min_index < 0 || g[v][i] < g[v][min_index])) | |
min_index = i; | |
value += g[v][min_index]; | |
solve(g, used, path, value, start, min_index); | |
} | |
int main(void) { | |
ios::sync_with_stdio(false); | |
int n; | |
cin >> n; | |
vector< pair<float, float> > points; | |
for(int i = 0; i < n; i++) { | |
float x, y; | |
cin >> x >> y; | |
points.push_back(make_pair(x, y)); | |
} | |
// build graph | |
vector< vector< float > > g(n, vector< float > (n)); | |
for(int i = 0; i < n; i++) { | |
for(int j = 0; j < n; j++) { | |
g[i][j] = cartesianDistance(points[i], points[j]); | |
} | |
} | |
cout << "matrix: " << endl; | |
for(int i = 0; i < n; i++) { | |
for(int j = 0; j < n; j++) { | |
cout << fixed << setw(5) << setprecision(2) << g[i][j] << " "; | |
} | |
cout << endl; | |
} | |
vector< bool > used(n, false); | |
vector< int > rpath, path; | |
float rvalue = 9999999.0f, value = 0.0f; | |
for(int i = 0; i < n; i++) { | |
solve(g, used, path, value, i, i); | |
if(value < rvalue) { | |
rpath = path; | |
rvalue = value; | |
} | |
path.clear(); | |
used.assign(n, false); | |
value = 0.0f; | |
} | |
cout << "answer: " << setprecision(2) << rvalue << endl; | |
cout << "path:" << endl; | |
for(auto x: rpath) | |
cout << x << " "; | |
cout << endl; | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment