当前位置：网站首页>Difference between breadth first notes and breadth first notes

Difference between breadth first notes and breadth first notes

2022-04-21 23:35:00 【Struggling big head】

The essential difference between depth first search and breadth first search
This is an article on Zhihu , It's easy to understand , Especially for the commonly used path planning algorithms ,A*,Dijkstra Algorithm , Ant colony algorithm has a certain understanding of students . In short, path planning and tree are graph theory in the final analysis , A graph is a matrix , Finally, it's the operation of the matrix .
The depth first algorithm is to go deep in the tree and use the stack First in, then out thought ( As the name suggests, it is to put the number in the stack first and then out of the stack ) , The breadth first algorithm adopts the idea of queue first in first out in the tree ( As the name suggests, it is the number of first queue and then out queue ).

版权声明
本文为[Struggling big head]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/04/202204212333243850.html

边栏推荐

猜你喜欢

随机推荐