Skip to content

dodobyte/astar

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 

Repository files navigation

A* in Go

This is a very small (120 sloc) single file, single function A* implementation in Go.

I implemented it to use in games with tile-based maps. It's not trying to be super-generic or super-flexible. It's just small and straightforward.

The only function is FindPath and the only data structure is Point.

type Point struct {
	X, Y int
}

func FindPath(grid [][]byte, start, end Point) []Point

About

Very small A* algorithm implementation in Go

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages