The only way I'll keep learning more algorithms. :) EDIT: Currently, I'm pursuing a certification so I'm pausing 1algo1week project.
Depth-first search is an algorithm for finding (or traversing) graph data structures. You start at the root and explore the branch as further as possible before going back (also called backtracking).
DFS written in Ruby: