A* pathfinding library for the Odin programming language
✔️ A* Pathfinding Algorithm – Find the shortest path efficiently.
✔️ Multiple Heuristics – Choose from Euclidean (default), Manhattan, Octile, and Chebyshev.
✔️ Configurable Costs & Obstacles – Set custom movement costs and blocked tiles.
✔️ Multiple Diagonal Modes – Choose from NO_CORNER_CUT (default), NEVER, and ALWAYS.
✔️ Custom Entity Sizes - Supports entities larger than one tile. If the target position doesn't fully accommodate the entity's footprint, FabFlow automatically returns a path to the nearest valid position.
To include FabFlow in your Odin project, add it as a Git submodule:
git submodule add https://github.com/tykim83/FabFlow.git vendor/FabFlow
git submodule update --init --recursivepackage fabflowtest
import "core:fmt"
import ff "/vendor/FabFlow"
main :: proc() {
blocked_tiles: [][2]i32 = {
{4, 2}, {4, 3}, {4, 4}, // Vertical block
{1, 4}, {2, 4}, {3, 4}, // Horizontal block
}
// Initialize 8x8 grid
grid := ff.init_grid({0,0}, {8, 8})
defer ff.destroy_grid(&grid)
// Set blocked tiles
for tile in blocked_tiles {
ff.set_blocked_tile(&grid, tile)
}
// Set custom movement cost
ff.set_tile_cost(&grid, {4, 1}, 3.0)
// Find path from (0,0) to (7,7)
path, found := ff.find_path(grid, {0, 0}, {7, 7})
defer ff.destroy_path(&path)
if found {
fmt.println("Path found:")
for node, i in path.nodes {
fmt.printf("%v ->(%v, %v) ", i, node.tile.pos.x, node.tile.pos.y)
}
} else {
fmt.println("No path found.")
}
}FabFlow supports pathfinding for entities larger than a single tile. When you specify a custom entity size, the algorithm verifies that the entire footprint can move through the grid. If the target area doesn't fully accommodate the entity, the library automatically computes a path to the closest valid position where the entity can fit.
entity_size: [2]i32 = {2, 2}
path, found :=
5415
ff.find_path(grid, {0, 0}, {7, 7}, entity_size)FabFlow was inspired by odin_pathgrid by scoobery.