Description: A-star algorithm for the shortest path. Formula is expressed as: f (n) g (n)+h (n), where f (n) the initial state via the state n to the target state the cost estimate, g (n) is in the state space the initial state to actual cost state n, h (n) is an estimate of the cost the state to the target state n the best path.
To Search:
File list (Check if you may need any files):
A-star\.classpath
......\.project
......\.settings\org.eclipse.jdt.core.prefs
......\bin\AStar$NodeFComparator.class
......\...\AStar.class
......\...\Main.class
......\...\MapNode.class
......\src\AStar.java
......\...\Main.java
......\...\MapNode.java
......\.settings
......\bin
......\src
A-star
Download