Questions tagged [graph-search]

For questions related to the graph search. As opposed to a tree search, a graph search uses a list or set, called the closed list (or explored set), which contains the already visited and expanded nodes (or states) of the search space (which is usually represented as a graph, both in the case of tree and graph searches), so that not to revisit these already visited nodes.

Filter by
Sorted by
Tagged with
2
votes
1answer
42 views

In the graph search version of A*, can I stop the search the first time I encounter the goal node?

I am going through Russel and Norvig's Artificial Intelligence: A Modern Approach (3rd edition). I was reading the part regarding the A* algorithm A* graph search version is optimal when heuristic ...
3
votes
2answers
535 views

What is the difference between graph search and tree search? [duplicate]

First of all, there is a lot of misunderstanding about the graph search and tree search. The difference between these two is not about graphs and trees. They have two different algorithms. You can ...
9
votes
3answers
8k views

What is the difference between tree search and graph search?

I have read various answers to this question at different places, but I am still missing something. What I have understood is that a graph search holds a closed list, with all expanded nodes, so ...