-
-
**Add Depth First Search algorithm to traverse in a graph (Python / C++)**
-
For very big graphs, the recursive DFS algorithm can cause a stackoverflow.
Refactoring : while loop without recursive calls -> use a stack (push / pop during vertices visit)
-
https://www.acmicpc.net/problem/1260
-
Add DFS using C++. in the directory Algorithms, if not available create one.
-
The following toy example returns a `list[list[pd.DataFrame]]` instead of `list[pd.DataFrame]`.
![test_flow](https://github.com/user-attachments/assets/22f6e012-b805-4dff-ac03-466bb31ba444)
``…
-
-
# [Python] DFS 기초 예제와 코드 구현 - 성장하는 개발자
관련 백준 문제 (1260번) DFS와 BFS
[https://parkm2ngyu00.github.io/algorithm/DFS/](https://parkm2ngyu00.github.io/algorithm/DFS/)
-
[10026 적록색약](https://www.acmicpc.net/problem/10026)
-
Rok93 updated
2 years ago