# Algorithm
###### tags: `algorithm`
### ==Breadth-first serach==
>時間複雜度 :　$O(V+E)$
$V為節點 E為邊$


#### ==The operation of BFS==

#### ==Shortest paths==
δ(s,v) : shortest path from s to v
Shortest path參考網站 :
http://ccisgjt.ddns.net:13001/books/2021110-algorithms/page/algorithms-I8I

#### ==Dijkstra's algorithm==
> 時間複雜度 : $O(V^2 + E) = O(V^2)$
- 利用**greedy**方法求解

#### ==Bellman-Ford algorithm==
> 時間複雜度 : $O(VE)$
- 遍歷方法

### ==Depgth-First Search==
> 時間複雜度 : $O(V+E)$


#### The progress of DFS

#### Topological sort

### ==Minimum Spanning Tree==

#### ==Kruskal's algorihtm==
> Complexity : $O(ElogE)$


#### ==Prim's algorithm==
> Complexity : $O(VlogV + ElogV)$, or $O(E + VlogV)$


### ==Single-Source Shortest Paths==
- Single-desination shortest path problem
- Single pair shortest path problem
- All-pair shortest paths problem