layman
-
Posts
10 -
Joined
-
Last visited
-
Feedback
100%
Everything posted by layman
-
Assuming you are talking about unweighted undirected graphs, DFS cannot be used to find the shortest path in a graph. Only BFS is capable of that.