1     // 用邻接矩阵存储图
 2     int **data = new int*[n];
 3     int **eCost = new int*[n];
 4     for(int i=0; i<n; i++)
 5     {
 6         data[i] = new int[n];
 7         eCost[i] = new int[n];
 8     }
 9     // 邻接矩阵初始化
10     for(int i=0; i<n; i++)
11     {
12         for(int j=0; j<n; j++)
13         {
14             data[i][j] = MAXNUM;
15             eCost[i][j] = MAXNUM;
16         }
17     }

 1     // 处理输入数据，并构造邻接矩阵
 2     for(int i=0; i<m; i++)
 3     {
 4         int a1, a2, a3, a4;
 5         cin >> a1 >> a2 >> a3 >> a4;
 6         data[a1][a2] = a3;
 7         data[a2][a1] = a3;
 8         eCost[a1][a2] = a4;
 9         eCost[a2][a1] = a4;
10     }

 1 #include <iostream>
 2
 3 #define MAXNUM 10000000
 4
 5 using namespace std;
 6
 7 struct node
 8 {
 9     int city1;
10     int city2;
11     int len;
12     int cost;
13     node(int a, int b,int c, int d):city1(a), city2(b), len(c), cost(d) {}
14 };
15
16 int main()
17 {
18     int n, m, s, d;
19     cin >> n >> m >> s >> d;
20     // 用邻接矩阵存储图
21     int **data = new int*[n];
22     int **eCost = new int*[n];
23     for(int i=0; i<n; i++)
24     {
25         data[i] = new int[n];
26         eCost[i] = new int[n];
27     }
28     // 邻接矩阵初始化
29     for(int i=0; i<n; i++)
30     {
31         for(int j=0; j<n; j++)
32         {
33             data[i][j] = MAXNUM;
34             eCost[i][j] = MAXNUM;
35         }
36     }
37     // 处理输入数据，并构造邻接矩阵
38     for(int i=0; i<m; i++)
39     {
40         int a1, a2, a3, a4;
41         cin >> a1 >> a2 >> a3 >> a4;
42         data[a1][a2] = a3;
43         data[a2][a1] = a3;
44         eCost[a1][a2] = a4;
45         eCost[a2][a1] = a4;
46     }
47     // Dijstra算法开始
48     // 记录当前路径长度
49     int *dist = new int[n];
50     // 记录当前花费
51     int *cost = new int[n];
52     // 初始化
53     for(int i=0; i<n; i++)
54     {
55         dist[i] = MAXNUM;
56         cost[i] = MAXNUM;
57     }
58     dist[s] = 0;
59     cost[s] = 0;
60     for(int k=0; k<2; k++)
61     {
62         for(int V=0; V<n; V++)
63         {
64             for(int W=0; W<n; W++)
65             {
66                 if(dist[V] != MAXNUM)
67                 {
68                     if ( dist[V] + data[V][W] < dist[W] )
69                     {
70                         dist[W] = dist[V] + data[V][W];
71                     }
72                     else if ( dist[V] + data[V][W] == dist[W]
73                               && cost[V] != MAXNUM
74                               && cost[V] +  eCost[V][W] < cost[W])
75                     {
76                         cost[W] = cost[V] + eCost[V][W];
77                     }
78                 }
79             }
80         }
81     }
82     cout << dist[d] <<  " " << cost[d] << endl;
83     return 0;
84 }