AI笔记--BFS and DFS

Which one is optimal?(provides an optimal solution)

1 BFS

2 DFS

Answer:1


Which one is right?

1 Build the tree in memory first and apply different search algorithm to find the solution.

2 Apply different search algorithm and build the tree as the search goes.

  On the other words, choose the algorithm first and load the tree dynamically.

Answer:2


Blind Search(Uninformed Search) includes:

BFS

DFS

Limited depth Search

Iterative deepening

Uniform cost Search

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值