What is the difference between graph search and tree search?

Question

What is the difference between graph search and tree search versions regarding DFS, A* searches in artificial intelligence?

Answer 1

In simple words, tree does not contain cycles and where as graph can. So when we do search, we should avoid cycles in graphs so that we don't get into infinite loops.

Another aspect is tree will typically have some kind of topological sorting or a property like binary search tree which makes search so fast and easy compared to graphs.