最短路径问题

[问题描述]

已知有向图有12个顶点，21条边，起点为S，终点为E，求从S到E的最小成本花费W。(如图)

起点    终点    花费           起点    终点    花费            起点    终点    花费

1        2       9              4       8       11               9      12      4

1        3       7              5       7       11               10     12      2

1        4       3              5       8       8                11     12      5

1        5       2              6       9       6

2        6       4              6       10      5

2        7       2              7       9       4

2        8       1              7       10      10

3        6       2              8       10      15

3        7       7              8       11      16

[输入要求]

     有多组测试数据，第一行输入S(1<=S<12)，其中S为起点，E=12为终点， 

[输出要求]

      每组测试数据对应一个输出，输出S到终点E最小成本花费W

[样例输入]

1

2

[样例输出]

16

10

 

 

源代码

 

# include<iostream> # include<fstream> using namespace std; int lweight; int xweight; typedef struct { int first; int rear; int weight; }node; //定义图中结点 typedef struct link { int num; int weight; struct link *next; }link; node graph[22]; link linjiebiao[13]; link linjiedian[13][22]; void jianliljb(link *ljb,node *g) { for(int i=1;i<=12;i++) { ljb[i].num=i; ljb[i].weight=0; ljb[i].next=NULL; } for( i=1;i<=12;i++) { for(int j=1;j<=21;j++) { if(g[j].first==i) { linjiedian[i][j].num=g[j].rear; linjiedian[i][j].weight=g[j].weight; linjiedian[i][j].next=ljb[i].next; ljb[i].next=&linjiedian[i][j]; } } } } void bianli(int n) { if(n==12) { if(xweight<lweight) lweight=xweight; return ; } else { for( link *p=linjiebiao[n].next;p;p=p->next) { { xweight+=p->weight; bianli(p->num); xweight-=p->weight; } } } } int main() { int n; graph[1].first =1;graph[1].rear=2;graph[1].weight=9; graph[2].first =1;graph[2].rear=3;graph[2].weight=7; graph[3].first =1;graph[3].rear=4;graph[3].weight=3; graph[4].first =1;graph[4].rear=5;graph[4].weight=2; graph[5].first =2;graph[5].rear=6;graph[5].weight=4; graph[6].first =2;graph[6].rear=7;graph[6].weight=2; graph[7].first =2;graph[7].rear=8;graph[7].weight=1; graph[8].first =3;graph[8].rear=6;graph[8].weight=2; graph[9].first =3;graph[9].rear=7;graph[9].weight=7; graph[10].first =4;graph[10].rear=8;graph[10].weight=11; graph[11].first =5;graph[11].rear=7;graph[11].weight=11; graph[12].first =5;graph[12].rear=8;graph[12].weight=8; graph[13].first =6;graph[13].rear=9;graph[13].weight=6; graph[14].first =6;graph[14].rear=10;graph[14].weight=5; graph[15].first =7;graph[15].rear=9;graph[15].weight=4; graph[16].first =7;graph[16].rear=10;graph[16].weight=10; graph[17].first =8;graph[17].rear=10;graph[17].weight=15; graph[18].first =8;graph[18].rear=11;graph[18].weight=16; graph[19].first =9;graph[19].rear=12;graph[19].weight=4; graph[20].first =10;graph[20].rear=12;graph[20].weight=2; graph[21].first =11;graph[21].rear=12;graph[21].weight=5; jianliljb( linjiebiao,graph); for(int i=1;i<=12;i++) { link *pi= &linjiebiao[i]; while(pi!=NULL) { cout<<pi->num<<"--"; pi=pi->next; } cout<<endl; } cin>>n; xweight = 0; lweight = 10000; bianli( n); cout<<lweight<<endl;; return 1; }

以数组的形式存储边

#include<iostream> using namespace std; int arr[12][12]; int n; int count=0; int total[100]; void init() { int i=0,j=0; count=0; for(i=0;i<12;i++) for(j=0;j<12;j++) arr[i][j]=0; arr[0][1]=9; arr[0][2]=7; arr[0][3]=3; arr[0][4]=2; arr[1][5]=4; arr[1][6]=2; arr[1][7]=1; arr[2][5]=2; arr[2][6]=7; arr[3][7]=11; arr[4][6]=11; arr[4][7]=8; arr[5][8]=6; arr[5][9]=5; arr[6][8]=4; arr[6][9]=10; arr[7][9]=15; arr[7][10]=16; arr[8][11]=4; arr[9][11]=2; arr[10][11]=5; } int digui(int num,int value) { if(num==11) { total[count]=value; count++; return 0; } else{ for(int i=0;i<12;i++) { if(arr[num][i]!=0) { value=value+arr[num][i]; digui(i,value); value=value-arr[num][i]; } } } } int run(int c) { int i=0,j=0,min=10000; init(); digui(c-1,0); for(i=0;i<count;i++) { if(min>total[i]) min=total[i]; } return min; } int main() { while(scanf("%d",&n)!=EOF) { printf("%d/n",run(n)); } return 0; }