algorithm

package

v0.0.0-...-5e01725 Latest Latest Go to latest Published: Feb 12, 2018 License: MIT Imports: 5 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

This section is empty.

This section is empty.

func AStar(m storage.Interface, h Heuristic, start, end co.Interface) ([]co.Interface, bool)

AStar implements the A* algorithm for hexagonal coordinates

func Reachable(storage storage.Interface, start co.Interface, movement int) []co.Interface

type Heuristic func(m *storage.Interface, start, end co.Interface) int

Heuristic defines a template to make custom heuristics

type Item struct {
	// contains filtered or unexported fields
}

type PriorityQueue []*Item

func (pq PriorityQueue) Len() int

Len implements sort.Interface

func (pq PriorityQueue) Less(i, j int) bool

Less implements sort.Interface

func (pq *PriorityQueue) Pop() interface{}

Pop implements heap.Interface

func (pq *PriorityQueue) Push(x interface{})

Push implements heap.Interface

func (pq PriorityQueue) Swap(i, j int)

Swap implements sort.Interface

func (pq *PriorityQueue) Update(item *Item, cost, priority int, parent []coordinate.Interface)

Update adjusts the priority of something on the heap