heuristic ( from to astar -- n )

Vocabulary

path-finding

Inputs

from	a node
to	a node
astar	an instance of a subclassed astar tuple

Outputs

n

a number

Word description

Return the estimated (undervalued) cost to go from from to to. from and to are not necessarily neighbors.

Definition

IN: path-finding

GENERIC: heuristic ( from to astar -- n )

Methods

USING: accessors combinators path-finding path-finding.private ;

M: astar-simple heuristic
    heuristic>> ( n1 n2 -- c ) call-effect ;


USING: kernel path-finding path-finding.private ;

M: bfs heuristic 3drop 0 ;


USING: kernel path-finding path-finding.private ;

M: dijkstra heuristic 3drop 0 ;