ShortestBushOneToAll (PLANitAllJavaOnly 0.4.0 API)

All Known Implementing Classes:

ShortestBushGeneralised
```
public interface ShortestBushOneToAll
```
An algorithm which calculates the shortest (a.k.a. lowest cost) bush to all vertices from a given origin vertex for a directed graph in downstream direction

Author:

markr

Method Summary

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

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