An interview question I was asked. I was first asked how to traverse a graph and next I was asked how to search one. Got the first one but not the second.
What is the modern standard way to search a graph (assume undirected) given no other context? I've a notion that it might have something to do with Dijkstra's algorithm but IDK what. It makes sense that one way is to simply traverse the graph until you find the item you are looking for but it sure doesn't seem optimal.