ShortestPathOneToAll (PLANitAllJavaOnly 0.4.0 API)

All Known Implementing Classes:

ShortestPathAcyclicMinMaxGeneralised, ShortestPathDijkstra
```
public interface ShortestPathOneToAll
```
An algorithm which calculates the shortest (a.k.a. lowest cost) path to all vertices from a given start vertex for a directed graph

Author:

markr

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method	Description
`ShortestPathResult`	`executeOneToAll(DirectedVertex currentOrigin)`	Construct shortest paths from source node to all other nodes in the network based on directed LinkSegment edges

- Method Detail
  - executeOneToAll
```
ShortestPathResult executeOneToAll(DirectedVertex currentOrigin)
```
    Construct shortest paths from source node to all other nodes in the network based on directed LinkSegment edges
    
    Parameters:
    
    currentOrigin - start vertex
    
    Returns:
    
    shortest path result that can be used to extract paths