Documentation
Path finding using the A* algorithm
Metadata
Words
Tuple classes
Generic words
Ordinary words
Class predicate words
Files
Metadata files
Path finding using the A* algorithm
Metadata
| Tags: | algorithms |
| Authors: | Samuel Tardieu |
Words
Tuple classes
| Class | Superclass | Slots |
 astar | tuple | g in-closed-set |
Generic words
| Word | Stack effect |
 cost | ( from to astar -- n ) |
| heuristic | ( from to astar -- n ) |
| neighbors | ( node astar -- seq ) |
Ordinary words
| Word | Stack effect |
 <astar> | ( neighbors cost heuristic -- astar ) |
| <bfs> | ( neighbors -- astar ) |
| <dijkstra> | ( costs -- astar ) |
| considered | ( astar -- considered ) |
| find-path | ( start target astar -- path/f ) |
| find-path* | ( start quot astar -- path/f ) |
Class predicate words
| Word | Stack effect |
| astar? | ( object -- ? ) |
Files
resource:extra/path-finding/path-finding.factor
resource:extra/path-finding/path-finding-docs.factor
resource:extra/path-finding/path-finding-tests.factor
resource:extra/path-finding/path-finding-docs.factor
resource:extra/path-finding/path-finding-tests.factor
Metadata files