[jbjbjbjb]

The more complex stuff like graph traversal, topological sort has come up in just a couple of scenarios with scheduling. I actually had to implement my own topological sort one time. Caching and memoization is helpful and that’s more frequent, cache invalidation is hard. I used a queue last week and that always feels good! It’s certainly not a day to day thing.

I think a lot of developers, even ones that studied computer science, don’t see it as useful or relevant. I feel like that makes them underestimate what the modern computer is capable of and also want to reach to the next shiny object to add to the stack.