I do agree to some extent, but depth-first search is not the correct allegory for the algorithm. You do follow a node to the end with depth-first. I think you meant breadth-first.
I think it would be most accurate to say its a backtracking algorithm, since you presumably would be exploring a certain path continually until it becomes unsatisfactory.