Programming, Computer Science, Graph Theory, Graph, Mathematics.
used on a search tree then it will expand forever, in other words depth first search is not complete within search trees. Depth first search will not find the optimal path. The time complexity of DFS is 1+ b² + b³ + … +b^m The advantage of DFS over BFS is the space complexity. Once a path has been