A* search algorithm in Swift
Swift Objective-C
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
AStar.xcodeproj
AStar
AStarTests
LICENSE
README.md

README.md

AStar

A* search algorithm in Swift

This is a experiment and learn project as much as anything. The basic approach would be for a user to sub-class Node to add the functionality necessary to describe a node in the users real system. One likely element of a subclass would be to override the heuristic, so that it functions as a useful divider. With the default value of 0, this function reverts to being Dijkstra's algorithm.