I have some questions regarding tree search and graph search (Uninformed search) as explained in chapter 3 of the book : http://aima.cs.berkeley.edu/
As I see, the only difference between the two is that the graph search handles loops (avoids them).
First question: Do both graph search and tree search build dynamic trees of the problem at hand?
Second question: I assume graph search was used to solve the map of Romania problem (getting from Arad to Bucharest) with DFS, BFS, UCS as strategies that only sort the frontier queue. Now is there a standard way to change the graph of map of Romania to a tree, and then use tree search?
Third question: What are some of the Criteria that help us choose between graph and tree search for different problems?
Thanks you in advance