743-network-delay-time.md Corrected some description.

gazeldx · gazeldx · commit 0b3e9ad63f4a · 2025-02-13T13:38:47.000+08:00
diff --git a/en/1-1000/743-network-delay-time.md b/en/1-1000/743-network-delay-time.md
@@ -56,10 +56,10 @@ For a detailed description of **Dijkstra's algorithm**, please refer to [1514. P
 ### Common graph theory algorithm comparison table
 |Algorithm name|Main application scenarios|Optimization methods|Importance|Difficulty|min_distances|Negative weights|Additional application scenarios|
 |--------------|--------------------------|--------------------|----------|----------|-------------|----------------|--------------------------------|
-|[Prim's algorithm](../1001-2000/1584-min-cost-to-connect-all-points.md)     |Minimum Spanning Tree       |Heap Sort     |Important     |Medium         |Used    |Able to handle||
-|[Kruskal's algorithm](../1001-2000/1584-min-cost-to-connect-all-points-2.md)|Minimum Spanning Tree       |Heap Sort     |important     |Relatively hard|Not used|Able to handle|Relative: [Undirected Graph Cycle Detection](./684-redundant-connection.md), [Directed Graph Cycle Detection](./685-redundant-connection-ii.md)|
-|[Dijkstra's algorithm](../1001-2000/1514-path-with-maximum-probability.md)  |Single-Source Shortest Path |Heap Sort     |Very important|Medium         |Used    |Unable to handle||
-|[Bellman-Ford algorithm](./743-network-delay-time.md)                       |Single-Source Shortest Path |Queue-Improved|Very Important|Easy           |Used    |Able to handle|[Detect Negative Cycles](https://www.geeksforgeeks.org/detect-negative-cycle-graph-bellman-ford/), <br>[Shortest Hop-Bounded Paths](./787-cheapest-flights-within-k-stops.md)|
+|[Prim's algorithm](../1001-2000/1584-min-cost-to-connect-all-points.md)     |Minimum Spanning Tree       |Heap Sort Simplify|Important     |Medium         |Used    |Can handle||
+|[Kruskal's algorithm](../1001-2000/1584-min-cost-to-connect-all-points-2.md)|Minimum Spanning Tree       |No need           |important     |Relatively hard|Not used|Can handle|Relative: [Undirected Graph Cycle Detection](./684-redundant-connection.md), [Directed Graph Cycle Detection](./685-redundant-connection-ii.md)|
+|[Dijkstra's algorithm](../1001-2000/1514-path-with-maximum-probability.md)  |Single-Source Shortest Path |Heap Sort         |Very important|Relatively hard|Used    |Cannot handle||
+|[Bellman-Ford algorithm](./743-network-delay-time.md)                       |Single-Source Shortest Path |Queue-Improved    |Very Important|Easy           |Used    |Can handle|[Detect Negative Cycles](https://www.geeksforgeeks.org/detect-negative-cycle-graph-bellman-ford/), <br>[Shortest Hop-Bounded Paths](./787-cheapest-flights-within-k-stops.md)|
 
 ## Complexity
 **V**: vertex count, **E**: Edge count.
diff --git a/en/3001-4000/unorganized.md b/en/3001-4000/unorganized.md
@@ -172,6 +172,8 @@ The improved way with a queue is commonly more efficient. Relaxing **All Edges**
 
 ### Graph
 - 417 https://leetcode.com/problems/pacific-atlantic-water-flow/
+- 
+
 
 ### Failed in 2 rounds
 - 222 https://leetcode.cn/problems/count-complete-tree-nodes/
@@ -186,5 +188,7 @@ The improved way with a queue is commonly more efficient. Relaxing **All Edges**
 - 647 https://leetcode.cn/problems/palindromic-substrings/ https://leetcode.cn/problems/palindromic-substrings/submissions/597748845/
 - 516 https://leetcode.cn/problems/longest-palindromic-subsequence/
 - 417 https://leetcode.com/problems/pacific-atlantic-water-flow/
+- 1584-min-cost-to-connect-all-points-2.md
+- 1514-path-with-maximum-probability.md
 
 2005-02-09 day 2
diff --git a/zh/1-1000/743-network-delay-time.md b/zh/1-1000/743-network-delay-time.md
@@ -58,9 +58,9 @@
 
 |算法名称|主要的适用场景|优化方式|重要度|难度|min_<br>distances|负边权值|额外的适用场景|
 |-------|-----------|-------|-------|---|-------------|--------|------------|
-|[Prim算法](../1001-2000/1584-min-cost-to-connect-all-points.md)     |最小生成树  |堆排序           |重要   |中等|用到|能处理||
-|[Kruskal算法](../1001-2000/1584-min-cost-to-connect-all-points-2.md)|最小生成树  |堆排序           |重要   |较难|不用|能处理|相关：[无向图环检测](./684-redundant-connection.md), [有向图环检测](./685-redundant-connection-ii.md)|
-|[Dijkstra算法](../1001-2000/1514-path-with-maximum-probability.md)  |单源最短路径|堆排序           |很重要|中等|用到|不能处理||
+|[Prim算法](../1001-2000/1584-min-cost-to-connect-all-points.md)     |最小生成树  |堆排序简化       |重要   |中等|用到|能处理||
+|[Kruskal算法](../1001-2000/1584-min-cost-to-connect-all-points-2.md)|最小生成树  |无需优化         |重要   |较难|不用|能处理|相关：[无向图环检测](./684-redundant-connection.md), [有向图环检测](./685-redundant-connection-ii.md)|
+|[Dijkstra算法](../1001-2000/1514-path-with-maximum-probability.md)  |单源最短路径|堆排序优化       |很重要|较难|用到|不能处理||
 |[Bellman-Ford算法](./743-network-delay-time.md)                     |单源最短路径|集合优化|很重要|简单|用到|能处理|[负环检测](https://www.geeksforgeeks.org/detect-negative-cycle-graph-bellman-ford/), [限定步数最短路径](./787-cheapest-flights-within-k-stops.md)|
 
 ## 复杂度
