ShortestPathSolver

Type Parameters:

V - the type of vertices.

All Known Implementing Classes:

DijkstraSolver, ToposortDAGSolver
```
public interface ShortestPathSolver<V>
```
Single-source shortest paths from a start vertex to all reachable vertices.

See Also:

ShortestPathSolver.Constructor, Graph, DijkstraSolver, ToposortDAGSolver

- Nested Class Summary
  
  Nested Classes
  Modifier and Type Interface Description
  
  static interface ShortestPathSolver.Constructor<V>
  Constructor for ShortestPathSolver.
- Method Summary
  
  All Methods Instance Methods Abstract Methods
  Modifier and Type Method Description
  
  List<V> solution(V goal)
  Returns the single-pair shortest path from a start vertex to the goal.

- Method Detail
  - solution
```
List<V> solution(V goal)
```
    Returns the single-pair shortest path from a start vertex to the goal.
    
    Parameters:
    
    goal - the goal vertex.
    
    Returns:
    
    a list of vertices representing the shortest path.