AStarSolver

java.lang.Object
- graphs.shortestpaths.AStarSolver<V>

Type Parameters:

V - the type of vertices.
```
public class AStarSolver<V>
extends Object
```
A* search implementation for single-pair shortest paths in an AStarGraph.

See Also:

AStarGraph

Field Summary

Fields
Modifier and Type Field Description

private Map<V,Double> distTo

private Map<V,Edge<V>> edgeTo

private V goal

private V start

Constructor Summary

Constructors
Constructor	Description
`AStarSolver(AStarGraph<V> graph, V start, V goal)`	Constructs a new instance by executing A* search on the graph from the start to the goal.

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type Method Description

List<V> solution()
Returns the single-pair shortest path from the stored start to the stored goal.
- Methods inherited from class java.lang.Object
  clone, equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Field Detail
  - edgeTo
```
private final Map<V,Edge<V>> edgeTo
```
  - distTo
```
private final Map<V,Double> distTo
```
  - start
```
private final V start
```
  - goal
```
private final V goal
```
- Constructor Detail
  - AStarSolver
```
public AStarSolver(AStarGraph<V> graph,
                   V start,
                   V goal)
```
    Constructs a new instance by executing A* search on the graph from the start to the goal.
    
    Parameters:
    
    graph - the input graph.
    
    start - the start vertex.
    
    goal - the goal vertex.
- Method Detail
  - solution
```
public List<V> solution()
```
    Returns the single-pair shortest path from the stored start to the stored goal.
    
    Returns:
    
    a list of vertices representing the shortest path.