From 0d6080ba5cd0d9a3548851758cf2858e5aa999da Mon Sep 17 00:00:00 2001 From: programmercarl <826123027@qq.com> Date: Tue, 6 Aug 2024 16:21:23 +0800 Subject: [PATCH] =?UTF-8?q?=20=E6=9B=B4=E6=96=B0spfa?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- problems/kamacoder/0094.城市间货物运输I-SPFA.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/problems/kamacoder/0094.城市间货物运输I-SPFA.md b/problems/kamacoder/0094.城市间货物运输I-SPFA.md index 3aa53655..07317d6b 100644 --- a/problems/kamacoder/0094.城市间货物运输I-SPFA.md +++ b/problems/kamacoder/0094.城市间货物运输I-SPFA.md @@ -162,7 +162,7 @@ ![](https://code-thinking-1253855093.file.myqcloud.com/pics/20240729161116.png) -所以我们在加入队列的过程可以有一个优化，用visited数组记录已经加入队列的元素，已经在队列的元素不用重复加入 +所以我们在加入队列的过程可以有一个优化，**用visited数组记录已经在队列里的元素，已经在队列的元素不用重复加入** -------------- @@ -233,7 +233,7 @@ int main() { while (!que.empty()) { int node = que.front(); que.pop(); - isInQueue[node] = false; // 从队列里取出的时候，要取消标记 + isInQueue[node] = false; // 从队列里取出的时候，要取消标记，我们只保证已经在队列里的元素不用重复加入 for (Edge edge : grid[node]) { int from = node; int to = edge.to;