Skip to content

Commit 1718da5

Browse files
authored
Create README.md
1 parent 6c9811e commit 1718da5

File tree

1 file changed

+18
-0
lines changed

1 file changed

+18
-0
lines changed

HW6/README.md

Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
## Dijkstra
2+
- 可以用來找某個起點到其他每個點的最小Cost。
3+
- 時間複雜度:O(E+VlogV)
4+
5+
<img src="/pic/Dijkstra.png" width="500" height="300">
6+
7+
8+
## Kruskal
9+
- 可以用來找一個Graph中把所有點跑完的最短路徑
10+
- 時間複雜度:O(ElogV)
11+
12+
<img src="/pic/Kruskal.png" width="500" height="300">
13+
14+
15+
(E:Edge、V:Vertice)
16+
17+
## 參考資料
18+
- [Kruskal](https://www.geeksforgeeks.org/kruskals-minimum-spanning-tree-algorithm-greedy-algo-2/)

0 commit comments

Comments
 (0)