Question: is depth first search greedy?
Answer: Is it possible for Greedy Best First Search to behave like Depth First Search in any case? No. ... Depth first search uses no such heuristic. One way to think of it is that Djiksta will return the shortest path on a graph with non-negative edges.