boorook.log
로그인
boorook.log
로그인
Boo Sung Jun
글
시리즈
소개
태그 목록
전체보기
(106)
JavaScript
(24)
typescript
(10)
dynamic programming
(6)
data structure
(6)
graph traversal
(5)
BFS
(5)
러닝
(5)
Binary Search
(5)
math
(4)
Backtracking
(4)
greedy
(4)
String
(3)
Shortest Path
(3)
Two pointers
(3)
Trie
(3)
tree
(3)
floyd-warshall
(2)
Union Find
(2)
JOIN
(2)
brute force
(2)
topological sorting
(2)
Prefix sum
(2)
sql
(2)
Implementation
(2)
vite
(2)
disjoint set
(2)
Divide and conquer
(2)
simulation
(2)
Minimum Spanning Tree
(2)
React
(2)
dijkstra
(2)
Amplify
(1)
Bit manipulation
(1)
tailwindCSS
(1)
pwa
(1)
개념
(1)
프로젝트
(1)
ESLint
(1)
Prettier
(1)
Kruskal Algorithm
(1)
kruskal
(1)
Dijksta
(1)
DFS
(1)
select
(1)
aws
(1)
전체보기
(106)
JavaScript
(24)
typescript
(10)
dynamic programming
(6)
data structure
(6)
graph traversal
(5)
BFS
(5)
러닝
(5)
Binary Search
(5)
math
(4)
Backtracking
(4)
greedy
(4)
String
(3)
Shortest Path
(3)
Two pointers
(3)
Trie
(3)
tree
(3)
floyd-warshall
(2)
Union Find
(2)
JOIN
(2)
brute force
(2)
topological sorting
(2)
Prefix sum
(2)
sql
(2)
Implementation
(2)
vite
(2)
disjoint set
(2)
Divide and conquer
(2)
simulation
(2)
Minimum Spanning Tree
(2)
React
(2)
dijkstra
(2)
Amplify
(1)
Bit manipulation
(1)
tailwindCSS
(1)
pwa
(1)
개념
(1)
프로젝트
(1)
ESLint
(1)
Prettier
(1)
Kruskal Algorithm
(1)
kruskal
(1)
Dijksta
(1)
DFS
(1)
select
(1)
aws
(1)
[Python] 백준 14502 - 연구소 문제 풀이
분류: Graph Traversal (그래프 탐색)
BFS
Backtracking
DFS
graph traversal
2022년 3월 11일
·
0개의 댓글
·
0