astar

README

A*

Documentation

Index

• type Cost
• type Node
  • func Astar(node0, goal Node) (path []Node)
• type QMap
  • func (qm *QMap) Add(v Node, priority Cost)
  • func (qm *QMap) Get(v Node) (*qitem, bool)
  • func (qm *QMap) Init()
  • func (qm *QMap) Len() int
  • func (qm *QMap) Pop() Node
  • func (qm *QMap) Update(x *qitem, newPriority Cost)

Examples

• QMap

Types

type Cost

type Cost int

type Node

type Node interface {
	Nbs() []Node
	DistanceTo(other Node) Cost
	EstimateTo(other Node) Cost
}

func Astar

func Astar(node0, goal Node) (path []Node)

type QMap

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

QMap is a hybrid of priority queue and map, allowing for O(log(N)) Add/Update and O(1) Pop/Get.

Example

fmt.Print(qmapExample())

Output:

[two foo five five2]

func (*QMap) Add

func (qm *QMap) Add(v Node, priority Cost)

func (*QMap) Get

func (qm *QMap) Get(v Node) (*qitem, bool)

Get returns element which can be updated by Update, plus a bool indicating if it existed.

func (*QMap) Init

func (qm *QMap) Init()

func (*QMap) Len

func (qm *QMap) Len() int

func (*QMap) Pop

func (qm *QMap) Pop() Node

func (*QMap) Update

func (qm *QMap) Update(x *qitem, newPriority Cost)

Update can only work on the element obtained by Get.