a few examples from personal experience > job 1 > write some code that takes a tree and spits out a quantum circuit > also write code to generate such a tree given some parameters > need breadth-based traversal (depth based didn't work because i needed to get to the leaves first to make sure the circuit was aligned in a pretty way. my boss wanted this) > job 2 > work on a language server > basically everything i implement crawls around the ast of parsed code > all sorts of hobby projects > need to find the shortest path from a to b (might be pathfinding for a video game or playing `5 clicks to hitler` on wikipedia or something else entirely) > normally you'd use djikstra or a* for this, but the distance on any edge is 1 so we can do simpler and better > use bfs that also records the path taken   if you had vision you'd be able to implement bfs
United States