DijkstraSolver

java.lang.Object
- graphs.DijkstraSolver<V>

Type Parameters:

V - the type of vertices.

All Implemented Interfaces:

ShortestPathSolver<V>
```
public class DijkstraSolver<V>
extends Object
implements ShortestPathSolver<V>
```
Dijkstra's algorithm implementation of the ShortestPathSolver interface.

See Also:

ShortestPathSolver

Nested Class Summary
- Nested classes/interfaces inherited from interface graphs.ShortestPathSolver
  ShortestPathSolver.Constructor<V>

Field Summary

Fields
Modifier and Type Field Description

private Map<V,Double> distTo

private Map<V,Edge<V>> edgeTo

Constructor Summary

Constructors
Constructor Description

DijkstraSolver(Graph<V> graph, V start)
Constructs a new instance by executing Dijkstra's algorithm on the graph from the start.

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`List<V>`	`solution(V goal)`	Returns the single-pair shortest path from a start defined in `Constructor#run(Graph, V)` to the goal.

Methods inherited from class java.lang.Object
clone, equals, finalize, 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
```
- Constructor Detail
  - DijkstraSolver
```
public DijkstraSolver(Graph<V> graph,
                      V start)
```
    Constructs a new instance by executing Dijkstra's algorithm on the graph from the start.
    
    Parameters:
    
    graph - the input graph.
    
    start - the start vertex.
- Method Detail
  - solution
```
public List<V> solution(V goal)
```
    Description copied from interface: ShortestPathSolver
    
    Returns the single-pair shortest path from a start defined in Constructor#run(Graph, V) to the goal.
    
    Specified by:
    
    solution in interface ShortestPathSolver<V>
    
    Parameters:
    
    goal - the goal vertex.
    
    Returns:
    
    a list of vertices representing the shortest path.