Agree...maybe I read too much into the listed algorithms, because you're suggesting real-world scenarios where some of these concepts can be applied. But I wil

Agree...maybe I read too much into the listed algorithms, because you're suggesting real-world scenarios where some of these concepts can be applied. But I will say, as never having used a graph search like Dijkstra's in any of my work, the idea of studying this to take a hiring test still goes with my theory of learning something by rote. If someday I need to implement the concept, or use it, I'm sure I'll go figure it out. I had to do this awhile ago with a Levenshtein distance for computing similar string matching. Had someone asked me in an interview, I'd have completely failed at it.