Home

UCS

1.解决bfs无法适用于带权值路径的问题

2.解决循环依赖

depth limited search

iterative deepening search

bidirectional search

1.是绝对对称的吗

best first search

`Best-First-Search(Graph g, Node start)

1) Create an empty PriorityQueue

   PriorityQueue pq;

2) Insert "start" in pq.

   pq.insert(start)

3) Until PriorityQueue is empty

      u = PriorityQueue.DeleteMin

      If u is the goal

         Exit

      Else

         Foreach neighbor v of u

            If v "Unvisited"

                Mark v "Visited"   
             
                pq.insert(v)

         Mark u "Examined"      

End procedure`