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

Package details

AuthorMichael Chow
MaintainerThe package maintainer <[email protected]>
LicenseMIT + file LICENSE
Package repositoryView on GitHub
Installation Install the latest version of this package by entering the following in R:
machow/astar-r documentation built on May 12, 2019, 7:35 a.m.