SingleSourceShortestPath (com.gengoai:mango 1.1-SNAPSHOT API)

Type Parameters:

V - the type parameter

All Known Implementing Classes:

DijkstraShortestPath
```
public interface SingleSourceShortestPath<V>
```
A shortest path interface that calculates the path for a single vertex to all other vertices in the graph.

Author:

David B. Bracewell

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method	Description
`Counter<V>`	`singleSourceShortestDistance(V source)`	The distance between the source vertex and all other vertices in the graph
`ListMultimap<V,Edge<V>>`	`singleSourceShortestPath(V source)`	The path (list of edges) between the source vertex and all other vertices in the graph

- Method Detail
  - singleSourceShortestDistance
```
Counter<V> singleSourceShortestDistance(V source)
```
    The distance between the source vertex and all other vertices in the graph
    
    Parameters:
    
    source - the source vertex
    
    Returns:
    
    Counter of target vertices and their distances.
  - singleSourceShortestPath
```
ListMultimap<V,Edge<V>> singleSourceShortestPath(V source)
```
    The path (list of edges) between the source vertex and all other vertices in the graph
    
    Parameters:
    
    source - the source vertex
    
    Returns:
    
    ListMultimap of target vertices and paths from source to target.