这个是用c语言写的求解货郎问题的解,注意这是贪心算法,并不是动态规划,也就是说这个不一定是最优解
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
static int M_dis[100];
static int r[100];
static int distance[100][100];
static int realcity_num;
int mindis(int start , int city_num )
{
r[city_num] = start;
int i,j;
for(i=1 ; i<=realcity_num ; i++)
{
if(i == start || M_dis[i] != 100000)
{
continue;
}
if (distance[start][i] < M_dis[start])
{
M_dis[start] = distance[start][i];
j=i;
}
}
city_num--;
if(city_num>=1)
{
return mindis(j, city_num );
}
}
int main()
{
int i,j;
int city_num,start;
printf("请输入一共有几个城市:");
scanf("%d",&realcity_num);
city_num = realcity_num;
srand(time(NULL));
printf("随机生成各个城市间的距离\n");
for(i=1 ; i<=city_num ; i++)
{
for(j=1 ; j<=i ; j++)
{
distance[i][j]=rand()%100+1;
distance[j][i]=distance[i][j];
if (i==j)
{
distance[i][j] = 0;
}
}
}
for(i=1 ; i<=city_num ; i++)
{
for(j=1 ; j<=city_num ; j++)
{
printf("%d\t",distance[i][j]);
}
printf("\n");
}
printf("从第几个城市出发:");
scanf("%d",&start);
for(i=1 ; i<=city_num ; i++)
{
r[i]=i;
M_dis[i]=100000;
}
mindis(start ,city_num );
printf("输出行走路径\n");
for(i=city_num ; i>=1 ; i--)
{
printf("%d\t",r[i]);
}
printf("%d\t",start);
}