举例说说明 启发式算法
The Lee algorithm is one possible solution for maze routing problems. It always gives an optimal solution, if one exists, but is slow and requires large memory for dense layout.
Lee算法是迷宫路由问题的一种可能解决方案。 如果存在的话,它总是提供最佳的解决方案,但是速度很慢,并且需要较大的内存才能进行密集的布局。
了解其运作方式 (Understanding how it works)
The algorithm is a breadth-first
based algorithm that uses queues
to store the steps. It usually uses the following steps:
该算法是基于breadth-first
算法,该算法使用queues
来存储步骤。 它通常使用以下步骤:
- Choose a starting point and add it to the queue. 选择一个起点并将其添加到队列中。
- Add the valid neighboring cells to the queue. 将有效的相邻单元格添加到队列中。