408/2022-WangDao-CS-DS-Notes
1
0
Fork 0
mirror of https://github.com/oxyanyano/2022-WangDao-CS-DS-Notes.git synced 2026-02-02 18:29:00 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 6.6最短路径(BFS、Dijkstra算法、Floyd算法).md

Browse Source
This commit is contained in:
岩岩
2022-03-29 11:44:56 +08:00
committed by GitHub
parent 4427d3c511
commit 408aa49d31
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
6.6最短路径(BFS、Dijkstra算法、Floyd算法).md
View File

@@ -1,8 +1,8 @@
## 最短路径
![1638172106501](F:\408数据结构\图片\1638172106501.png)
![1638172106501](https://github.com/oxyanyano/2022-WangDao-CS-DS-Notes/blob/main/images/1638172106501.png)
![1638178148141](F:\408数据结构\图片\1638178148141.png)
![1638178148141](https://github.com/oxyanyano/2022-WangDao-CS-DS-Notes/blob/main/images/1638178148141.png)
### 一、BFS算法（无权图）
@@ -90,9 +90,9 @@ void BFS(Graph G, int v){
`Dijkstra算法的局限性：不适用负权值带权图`。
![1638175026752](F:\408数据结构\图片\1638175026752.png)
![1638175026752](https://github.com/oxyanyano/2022-WangDao-CS-DS-Notes/blob/main/images/1638175026752.png)
![1638175026747](F:\408数据结构\图片\1638175026747.png)
![1638175026747](https://github.com/oxyanyano/2022-WangDao-CS-DS-Notes/blob/main/images/1638175026747.png)
### 三、Floyd算法（弗洛伊德算法）（带权图、无权图）