Wavefront And Dijkstra | Path Planning

Common non-heuristic based path finding algorithms, including Wavefront, Breadth-First Search, and Dijkstra's algorithm. Though not usually used on their own for finding single paths, these algorithms are easier to implement and provide basis for more efficient algorithms.

[@godwinikape8888]

Your videos are short, interesting and easy to understand. Very helpful video. Well-done! 👍🏽

[@Haav89]

Very helpful video. Thank you very much

[@Victor_Dias_]

thank you for the explanation!! you really helped me!!

[@TheKasz21]

2:27 It should be ascending order I think ;) Although for what I know Wavefront labels search space from the goal node and then it would truly be descending order :)