machow/astar-r: A* Algorithm for Finding Shortest Paths
Implements the A* search algorithm for finding an efficient path between nodes in a graph. A common use is for navigation, but there are other cool uses too!
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Michael Chow |
| Maintainer | The package maintainer <mc_al_github@fastmail.com> |
| License | MIT + file LICENSE |
| Version | 0.0.1 |
| Package repository | View on GitHub |
| Installation |
Install the latest version of this package by entering the following in R:
|
