path-finding vocabulary - Factor Documentation (original) (raw)
path-finding vocabulary
Factor handbook » Vocabulary index
Documentation
Path finding using the A* algorithm
Metadata
Tags: | algorithms |
---|---|
Authors: | Samuel Tardieu |
Words
Tuple classes
Class | Superclass | Slots |
---|---|---|
![]() |
![]() |
g in-closed-set |
Generic words
Word | Stack effect |
---|---|
![]() |
( from to astar -- n ) |
![]() |
( from to astar -- n ) |
![]() |
( node astar -- seq ) |
Ordinary words
Word | Stack effect |
---|---|
![]() |
( neighbors cost heuristic -- astar ) |
![]() |
( neighbors -- astar ) |
![]() |
( costs -- astar ) |
![]() |
( astar -- considered ) |
![]() |
( start target astar -- path/f ) |
![]() |
( start quot astar -- path/f ) |
Class predicate words
Word | Stack effect |
---|---|
![]() |
( 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
Metadata files
resource:extra/path-finding/authors.txt
resource:extra/path-finding/summary.txt
resource:extra/path-finding/tags.txt