https://stackoverflow.com/questions/26549140/breadth-first-search-time-complexity-analysis
Breadth First Search time complexity analysis
Time complexity to go over each adjacent edges of a vertex is say O(N), where N is number of adjacent edges. So for V number of vertices time complexity becomes O(V*N) = O(E), where E is the total ...
stackoverflow.com
'Programming > Note' 카테고리의 다른 글
| 최단 거리 알고리즘 노트 (0) | 2020.02.04 |
|---|---|
| Prim ~ Dijkstra (BOJ1197 최소 스패닝 트리, BOJ1753 최단경로) (0) | 2020.02.03 |
| When is it practical to use Depth-First Search (DFS) vs Breadth-First Search (BFS)? (0) | 2020.01.21 |
| std::vector<bool> (0) | 2020.01.19 |
| 시간 복잡도 정의 + Pseudo polynomial time complexity (0) | 2019.12.11 |