Learning Lua Step-By-Step (Part 14)

This entry is part 1 of 24 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 24 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).