Tags
- MAKE US
- ๋ฆฌ๋ ์ค ๋ช ๋ น์ด
- Data Structure
- GIT
- merge sort
- SQL
- Unity
- RP 2๊ธฐ
- aligoapi
- SSL
- Java
- ํจ์คํธ์บ ํผ์คX์ผ๋์
- ๊ตฌ๊ธ ์์ ๋ก๊ทธ์ธ
- DATABASE
- Spring
- C++
- Quick Sort
- mysql
- MethodArgumentNotValidException
- spring์ผ๋ก https ์ ์ฉ
- OpenAPI
- java error
- spring ์์ ๋ก๊ทธ์ธ
- ์์คํ ์ํํธ์จ์ด
- spring ๊ตฌ๊ธ ์์ ๋ก๊ทธ์ธ
- @CreatedDate
- datagrip
- node js
- Rp2๊ธฐ
- docker
๋ชฉ๋กdfs (1)
YS's develop story
๋๋น ์ฐ์ ํ์ (BFS), ๊น์ด ์ฐ์ ํ์ (DFS) ์ ๋ฆฌ
๐ฉ๐ป ๋๋น ์ฐ์ ํ์ (BFS), ๊น์ด ์ฐ์ ํ์ (DFS) ์ ๋ฆฌ with Python ๐ฅ ๋๋น ์ฐ์ ํ์ (Breadth-First-Search) Node ๊ฐ์ ๋ ๋ฒจ์ ์๋ Node๋ค (ํ์ Node๋ค)์ ๋จผ์ ํ์ํ๋ ๋ฐฉ์์ ๋๋ค. ํ์ด์ฌ์ ์ด์ฉํ ๊ทธ๋ํ ํํ ์ฝ๋ graph = dict() graph['A'] = ['B', 'C'] graph['B'] = ['A', 'D'] graph['C'] = ['A', 'G', 'H', 'I'] graph['D'] = ['B', 'E', 'F'] graph['E'] = ['D'] graph['F'] = ['D'] graph['G'] = ['C'] graph['H'] = ['C'] graph['I'] = ['C', 'J'] graph['J'] = ['I'] ๋๋น..
Algorithm
2021. 8. 3. 08:07