Backtracking 전용 template
Type backtrack(candidate) {
if find_solution(candidate):
output(candidate)
return
// iterate all possible candidates.
for next_candidate in list_of_candidates:
if is_valid(next_candidate):
// try this partial candidate solution
place(next_candidate)
// given the candidate, explore further.
backtrack(next_candidate)
// backtrack
remove(next_candidate)
}
'알고리즘 > Template' 카테고리의 다른 글
[Algorithm][Template] 크루스칼 알고리즘 (0) | 2022.01.03 |
---|---|
[Algorithm][Template] 서로소 집합(Disjoint Set), Union-Find (0) | 2022.01.02 |
[Algorithm][Template] 플로이드 워셜 알고리즘 (0) | 2021.12.29 |
[Algorithm][Template] Dijkstra 최단거리 탐색 (0) | 2021.12.18 |
[Algorithm][Template] Divide and Conquer (0) | 2021.10.20 |