From e325fd405e7511c787019521817dba0836436a0a Mon Sep 17 00:00:00 2001
From: LHY0125 <3364451258@qq.com>
Date: Tue, 16 Dec 2025 08:57:13 +0800
Subject: [PATCH] =?UTF-8?q?=E6=9B=B4=E6=96=B0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 exercise/44.c   |  56 +++++++++++++-----------------------------------
 exercise/44.exe | Bin 59466 -> 59466 bytes
 2 files changed, 15 insertions(+), 41 deletions(-)

diff --git a/exercise/44.c b/exercise/44.c
index 7659a53..6bfca98 100644
--- a/exercise/44.c
+++ b/exercise/44.c
@@ -14,24 +14,24 @@ typedef struct
 typedef AMGraphStruct *AMGraph;
 
 // 定义最大顶点数和最大边权值
-#define MaxInt 0x3f3f3f3f
-#define MAXN 1005      // 最大顶点数
-static bool S[MAXN];   // S[i]为true表示顶点i已加入集合S，否则未加入
-static int D[MAXN];    // D[i]为v0到顶点i的当前最短路径长度
-static int Path[MAXN]; // Path[i]为v0到顶点i的最短路径上的前驱顶点
+#define MaxInt 99999    // 最大边权值，用于初始化距离数组
+#define MAXN 1005       // 最大顶点数
+static bool S[MAXN];    // S[i]为true表示顶点i已加入集合S，否则未加入
+static int D[MAXN];     // D[i]为v0到顶点i的当前最短路径长度
+static int Path[MAXN];  // Path[i]为v0到顶点i的最短路径上的前驱顶点
 
 // Dijkstra算法求最短路径
 void ShortestPath_DIJ(AMGraph G, int v0)
 {
     // 初始化
-    int n, i, v, w; // n为顶点数，i为循环变量，v为当前顶点，w为邻接顶点
+    int n, i, v, w;     // n为顶点数，i为循环变量，v为当前顶点，w为邻接顶点
     int min;
     n = G->vexnum;
-    for (v = 0; v < n; ++v)
+    for (v = 0; v < n;++v)
     {
         S[v] = false;
         D[v] = G->arcs[v0][v];
-        if (D[v] < MaxInt)
+        if (D[v]<MaxInt)
         {
             Path[v] = v0;
         }
@@ -50,25 +50,19 @@ void ShortestPath_DIJ(AMGraph G, int v0)
         min = MaxInt;
         for (w = 0; w < n; ++w)
         {
-            if (!S[w] && D[w] < min)
+            if (!S[w] && D[w]<min)
             {
                 v = w;
                 min = D[w];
             }
         }
-
-        // 如果min为MaxInt，说明v0到其他顶点的路径都不可达
-        if (min == MaxInt)
-        {
-            break;
-        }
         S[v] = true;
 
         // 修改当前最短路径及距离
         for (w = 0; w < n; ++w)
         {
             if (!S[w] && (D[v] + G->arcs[v][w] < D[w]))
-            {
+        {
                 D[w] = D[v] + G->arcs[v][w];
                 Path[w] = v;
             }
@@ -90,12 +84,7 @@ int main(void)
     {
         return 0;
     }
-    if (n < 1 || n > MAXN || m < 0)
-    {
-        printf("参数不符合要求\n");
-        return 0;
-    }
-    
+
     // 初始化邻接矩阵
     AMGraph g = (AMGraph)malloc(sizeof(*g));
     g->vexnum = n;
@@ -104,9 +93,7 @@ int main(void)
     {
         g->arcs[i] = (int *)malloc((size_t)n * sizeof(int));
         for (int j = 0; j < n; ++j)
-        {
             g->arcs[i][j] = (i == j) ? 0 : MaxInt;
-        }
     }
 
     // 输入边信息
@@ -114,28 +101,15 @@ int main(void)
     {
         int x, y, z;
         if (scanf("%d %d %d", &x, &y, &z) != 3)
-        {
-            for (int k = 0; k < n; ++k) free(g->arcs[k]);
-            free(g->arcs);
-            free(g);
-            printf("参数不符合要求\n");
             return 0;
-        }
-        if (x < 1 || x > n || y < 1 || y > n || z <= 0 || z > 10000)
+        if (x >= 1 && x <= n && y >= 1 && y <= n)
         {
-            for (int k = 0; k < n; ++k) free(g->arcs[k]);
-            free(g->arcs);
-            free(g);
-            printf("参数不符合要求\n");
-            return 0;
-        }
-        if (z < g->arcs[x - 1][y - 1])
-        {
-            g->arcs[x - 1][y - 1] = z;
+            if (z < g->arcs[x - 1][y - 1])
+                g->arcs[x - 1][y - 1] = z;
         }
     }
 
-    // 执行Dijkstra算法
+    // 调用Dijkstra算法
     ShortestPath_DIJ(g, 0);
     if (D[n - 1] >= MaxInt)
     {
diff --git a/exercise/44.exe b/exercise/44.exe
index d48f4e883aab58cca5259a062ec5a887fc5dd892..8dada5836027420a70419bb1c37523c2f34779c7 100644
GIT binary patch
delta 687
zcmYjOZAep57(Qp4DQ<GDw4kg-93pDk7K6NLZny5@2(uK7zD$J;f7HYe975tQ>pJvy
zyEeOjLMZg7L=atQB^0CCtkDk}1(6U0X&bkq{)7wbbZ$oV{y6XZyodLBpXZ#+f;qEb
zj*ppk-=4U9%#@y)cykXnYZGv(1lrZX(&O-vI$zobgDSG_;PxJoZ8OnAgU90$>`iim
zPp&WKqU1Mbcv#@-Y;brTC)r?E9E(W{79Yb#HWf~ZPayl5iJek=tedxXo(BL2vS~{>
z#7fb%GXTt6;(&(!LQ7arZ$dh)aUg^oijN%nXa;~8eNJ04kDRe2C#9LOhd_1j>=j<m
zQY9Xa;a^G>QLHpW%)SaQV>UI=g2fcnZ@Ct`82gC94X|u`Ycz9#pM<b&$RT{f(%0Mx
ziu_U`*F-Z`%C>C;ASeAG#FfP2ocC;d$2qQzYv(#rzSuWrWXd2?La5&7dapMLjGZ@>
z^2jawkt3FjgxRM;9}cvlS~eqyu`Dw_L<pgm^|5Encn__y%%@lC{PERci$qUOoP#_Y
zM9xT~U*S=0qm;)=D{@mQGaIOs!2%)Tig{qtwWyc<wJ=QuQVRn0kY_2WYmw4lt)f+a
zj{&oWqZ`X~Gmjitsq8-tfS7~$x?FK7`rY`hNG;vaVr;m%YRvyf?pq`O^F9YCGT8Rf
zoX@X4Qk5}RQy^xdr`2g|Re4@tA|(DVwDp!d@b0er#n7ugs7{z*LhExfrZQ9mz?Dt_
zyfphXW&hB@qLUDSViopQs$VW3^=S7b3~KMX!+w)@yE@gsMRksrs268Ll<323p!yd~
C0V#+8

delta 679
zcmX|;Ur1AN6vuzRZRXUCo8=-TYQ)d%Va66x-u&0EuJId8>p_BQYPj$rH8h%mq8Gak
zz1?n1Zcqe4JrqVgdBJK=quExAz$71P5QJruTTw5eVcgCo@w}XKet$mS!}nz8?AbYc
ze8N`uc=BqC?WBG3!wmN8llY4h7ipJ^kK-vVQyj)E8Y%I%dzzJoql)VxwYv&wtqTu3
zsO-W_N;;VI90&PS^u6=~^FO%Q1=BQ{G`sgqdq*1$(>B^pJ5o$77&wm*i_E7Tn=y1#
zrxD6H;t0Zc8`nCwSLm6N;5O2Ytyew7r#6}O-|Pr+;~_Xw1mce+shs8}>akY6yH89d
z8X+hrypzjDnR)^<ej&QV_|&CMOiE$nQB&+UH?|0TruLA!rod;TlG`<A2_mKl=@q65
z@wHm#uuXPSX%-9oIpXK8Ps4Rc6-Z4`US?`5sb;FXd@Dlv{Hke6EB5FRiwLAz5ktfm
zOOAB$FU3w4X(cs$R`kT?M@p3tsS{Lc($N*J5}|<`fm~OdDXx#!RQbifrpbqiPyEj0
zU-<>-Lh@?<4P?-{vjudDpbjL#z{BeXTJ{BUu~%Zkcpb<Y?*A+iU^h2l#&lrb0^MIS
zO|Z(xRL|fMgrq!Xx0JFgqkkH}tC1SeIAv)(SObj>6p)%XNY+@5&{?#DkeB<db*gS+
z{W}0280k2~GFJjpR<#~_sbdaL?|E8?z527NCpLUf@Aq>y_l|uCT|0}A7jlKJ?jJf-
tKw+PS8t(IGKf8%`toJq!>z{g~A)9xncK2er<{x)zgNYsheN9BF{sH1_9CZKy