Question

When bfs and dfs can be incomplete in Artificial Intelligence?

Answer 1

Answer:

In unbounded case

Explanation:-

BFS, Breadth-First Search, is a vertex-based technique for finding the shortest path in the graph. It uses a Queue data structure that follows first in first out. In BFS, one vertex is selected at a time when it is visited and marked then its adjacent are visited and stored in the queue. It is slower than DFS. BFS stands for Breadth First Search. BFS is a traversal approach in which we first walk through all nodes on the same level before moving on to the next level. BFS can be used to find a single source shortest path in an unweighted graph because, in BFS, we reach a vertex with a minimum number of edges from a source vertex.

DFS, Depth- First Search, is an edge-based technique. It uses the Stack data structure and performs two stages, first visited vertices are pushed into the stack, and second if there are no vertices then visited vertices are popped. DFS stands for Depth First Search.DFS is also a traversal approach in which the traverse begins at the root node and proceeds through the nodes as far as possible until we reach the node with no unvisited nearby nodes.In DFS, we might traverse through more edges to reach a destination vertex from a source.DFS is more suitable for game or puzzle problems. We make a decision, and the then explore all paths through this decision. And if this decision leads to win situation, we stop.

For more refers to-

https://brainly.in/question/52089918?referrer=searchResults

https://brainly.in/question/20314166?referrer=searchResults

#SPJ3