2020-01-22

最短路程/成本问题

#include

using namespace std;

#define MAX 50

int a[MAX][MAX] = {{ 0,0,10,0,30,100,},{0,0,4,0,0,0,1},{0,0,0,50,0, 0,1}, {0,0,0,0,0,10,1},{0,0,0,20,0,60,1},{0,0,0,0,0,0,0} };//在数组的首个标是否有路
int n = 6, pes = 0;
int sum = 0, min = 999999;

void bfs(int x, int y, int m)
{

if (m == y)
{
if (sum < min)
{
pes = 1;
min = sum;
}
return;
}

for (int i = 0; i < n; i++)
{
if (a[i][n] == 0 && i!= y) continue;
if (a[m][i] == 0) continue;

sum = sum + a[m][i];

bfs(x, y, i);

sum = sum - a[m][i];
}
}

int main()
{
int a, b;

cin >> a >> b;

bfs(a, b, a);

if (pes == 1)
cout << min << endl;
else
cout << “no” << endl;

return 0;
}
如有不完善之处，请多多指教