Learning Lua Step-By-Step (Part 14)

This entry is part 1 of 23 in the series Learning Lua Step-By-Step

Explore how to work with graphs and implement pathfinding algorithms in Lua. Learn about using graphs to model complex relationships and environments, and discover efficient algorithms like breadth-first search, depth-first search, Dijkstra’s algorithm, and A* pathfinding to find optimal paths.

Learning Lua Step-By-Step: Part 12

This entry is part 12 of 23 in the series Learning Lua Step-By-Step

Explore the world of trees and graphs in Lua programming. Learn how to create, manage, and traverse binary trees and directed graphs, along with essential traversal methods like depth-first search (DFS) and breadth-first search (BFS).

Graph Walking Made Easy!

Newbie Developers, especially those who are self-taught, often struggle with graph algorithms. I recently helped a young man on slack get a handle on the subject and I thought I would share my insights with those of you who lack the ability to write breadth-first search (BFS) and depth-first search (DFS) algorithms from scratch. Knowing