algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-07 07:35:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

更新spfa

Browse Source
This commit is contained in:
programmercarl
2024-08-06 16:21:23 +08:00
parent 5a8b89fa98
commit 0d6080ba5c
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/kamacoder/0094.城市间货物运输I-SPFA.md
View File

@ -162,7 +162,7 @@
![](https://code-thinking-1253855093.file.myqcloud.com/pics/20240729161116.png) ![](https://code-thinking-1253855093.file.myqcloud.com/pics/20240729161116.png)
所以我们在加入队列的过程可以有一个优化，用visited数组记录已经加入队列的元素，已经在队列的元素不用重复加入 所以我们在加入队列的过程可以有一个优化，**用visited数组记录已经在队列里的元素，已经在队列的元素不用重复加入**
-------------- --------------
@ -233,7 +233,7 @@ int main() {
while (!que.empty()) { while (!que.empty()) {
int node = que.front(); que.pop(); int node = que.front(); que.pop();
isInQueue[node] = false; // 从队列里取出的时候，要取消标记 isInQueue[node] = false; // 从队列里取出的时候，要取消标记，我们只保证已经在队列里的元素不用重复加入
for (Edge edge : grid[node]) { for (Edge edge : grid[node]) {
int from = node; int from = node;
int to = edge.to; int to = edge.to;