Graph traversal monsters

Monsters representing breadth first search, depth first search, and a stack data structure.

Three monsters, two small ones each labeled DFS and another BFS, and a third with large ears called Stack

Three monsters, two small ones each labeled DFS and another BFS, and a third with large ears called Stack