OSDN Git Service
(root)
/
oi-wiki
/
main.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
| inline |
side by side
(parent:
2aeedf1
)
Update shortest-path.md
author
AljcC
<42795073+AljcC@users.noreply.github.com>
Thu, 30 Aug 2018 00:38:08 +0000
(08:38 +0800)
committer
GitHub
<noreply@github.com>
Thu, 30 Aug 2018 00:38:08 +0000
(08:38 +0800)
docs/graph/shortest-path.md
patch
|
blob
|
history
diff --git
a/docs/graph/shortest-path.md
b/docs/graph/shortest-path.md
index
9f3b04e
..
3b8237e
100644
(file)
--- a/
docs/graph/shortest-path.md
+++ b/
docs/graph/shortest-path.md
@@
-164,6
+164,7
@@
while (!q.empty()) {
}
}
```
+spfa的时间复杂度**一般**在$o(mn)$,但稠密图可以随便卡掉spfa,所以考试时能不用就尽量别用。
## Dijkstra 算法