DFS & BFS

DFS is a depth-first search algorithm that preferentially searches the deep part of a graph.
BFS is a breadth-first search algorithm that searches first from the nearest node in the graph.

2022

© 2022. Byungchan Park. All rights reserved.