一个求最短路径的拙略算法，欢迎来讨论！！！！

#include "stdafx.h"
#include<iostream>
#include<string>
using namespace std;
int p[8][8] = {
{ 0 ,300 ,360 ,210 ,590 ,475 ,500 ,690 },
{ 300 ,0 ,380 ,270 ,230 ,285 ,200 ,390 },
{ 360 ,380 ,0 ,510 ,230 ,765 ,580 ,760 },
{ 210 ,270 ,510 ,0 ,470 ,265 ,450 ,640 },
{ 590 ,230 ,230 ,470 ,0 ,515 ,260 ,450 },
{ 475 ,285 ,765 ,265 ,515 ,0 ,460 ,650 },
{ 500 ,200 ,580 ,450 ,260 ,460 ,0 ,190 },
{ 690 ,390 ,760 ,640 ,450 ,650 ,190 ,0 }
};
bool vis[8] = { false };
int sqe[8] = { -1 };
int mindis = -1;


void ps() {
for (int i = 0; i < 7; i++)
{
cout << sqe[i] << " ";
}
cout << endl;
}


void display() {
int i, j;
cout << sqe[0];
for (i = 1; i<8; i++) {
cout << " -> " << sqe[i];
}
cout << "  Min: " << mindis << endl;
}




void dfs(int k) {
if (k >= 8) {


int sum = 0;
for (int i = 1; i < 8; i++)
{
sum += p[sqe[i - 1]][sqe[i]];
}
if (sum <= mindis || mindis<0) {
mindis = sum;
display();
}
//ps();
return;


}
for (int i = 0; i < 8; i++)
{
if (vis[i] == true) continue;
vis[i] = true;
sqe[k] = i;
dfs(k + 1);
vis[i] = false;
sqe[k] = -1;
}


}


int main()
{
system("title 最短路径");
dfs(0);


system("pause");
return 0;
}