Package | Description |
---|---|
squidpony.squidai.graph |
Graphs and graph algorithms used primarily (but not exclusively) for pathfinding.
|
Modifier and Type | Field and Description |
---|---|
static Heuristic<Coord> |
Heuristic.CHEBYSHEV
A predefined Heuristic for Coord nodes in a 2D plane where diagonal movement is estimated as costing the same as
orthogonal movement.
|
static Heuristic<Coord> |
Heuristic.DIJKSTRA
A predefined Heuristic for Coord nodes in a 2D plane where the heuristic is not used, and all cells are
considered equivalent regardless of actual distance.
|
static Heuristic<Coord> |
Heuristic.EUCLIDEAN
A predefined Heuristic for Coord nodes in a 2D plane where all movement is calculated "as-the-crow-flies," using
the standard Pythagorean formula for distance as in the real world.
|
static Heuristic<Coord> |
Heuristic.MANHATTAN
A predefined Heuristic for Coord nodes in a 2D plane where diagonal movement is estimated as costing twice as
much as orthogonal movement.
|
Modifier and Type | Field and Description |
---|---|
static java.util.List<Heuristic<Coord>> |
Heuristic.HEURISTICS
An unmodifiable List of all the Heuristic implementations in this class.
|
Modifier and Type | Method and Description |
---|---|
boolean |
CostlyGraph.findShortestPath(Coord start,
Coord target,
java.util.ArrayList<Coord> path,
Heuristic<Coord> heuristic)
Find the shortest path between the start and target vertices, using the A* search algorithm with the provided
heuristic, and implemented with a priority queue.
|
boolean |
DefaultGraph.findShortestPath(Coord start,
Coord target,
java.util.ArrayList<Coord> path,
Heuristic<Coord> heuristic)
Find the shortest path between the start and target vertices, using the A* search algorithm with the provided
heuristic, and implemented with a priority queue.
|
java.util.ArrayList<Coord> |
CostlyGraph.findShortestPath(Coord start,
Coord target,
Heuristic<Coord> heuristic)
Find the shortest path between the start and target vertices, using the A* search algorithm with the provided heuristic, and implemented with a priority queue.
|
java.util.ArrayList<Coord> |
DefaultGraph.findShortestPath(Coord start,
Coord target,
Heuristic<Coord> heuristic)
Find the shortest path between the start and target vertices, using the A* search algorithm with the provided heuristic, and implemented with a priority queue.
|
boolean |
Algorithms.findShortestPath(V start,
V target,
java.util.ArrayList<V> path,
Heuristic<V> heuristic)
Find the shortest path between the start and target vertices, using the A* search algorithm with the provided
heuristic, and implemented with a priority queue.
|
java.util.ArrayList<V> |
Algorithms.findShortestPath(V start,
V target,
Heuristic<V> heuristic)
Find the shortest path between the start and target vertices, using the A* search algorithm with the provided heuristic, and implemented with a priority queue.
|
Copyright © Eben Howard 2012–2022. All rights reserved.