<bfs> ( neighbors -- astar )
Path finding using the A* algorithm

Prev:	<astar> ( neighbors cost heuristic -- astar )
Next:	find-path ( start target astar -- path/f )

Vocabulary
path-finding

Inputs

neighbors

an assoc

Outputs

astar

an astar

Word description
Build an astar object from the neighbors assoc. When used with find-path, this astar tuple will use the breadth-first search (BFS) path finding algorithm which is a particular case of the general A* algorithm.

See also
<astar>, <dijkstra>

Definition

USING: accessors kernel path-finding.private ;

IN: path-finding

: <bfs> ( neighbors -- astar ) [ bfs new ] dip >>neighbors ;