Package org.goplanit.algorithms.shortest

Interface ShortestPathOneToOne

All Known Implementing Classes:

ShortestPathAStar

public interface ShortestPathOneToOne

An algorithm which calculates the shortest (a.k.a. lowest cost) path to all vertices from a given origin vertex for a directed graph

Author:

markr

Method Summary

Modifier and Type	Method	Description
ShortestPathResult	executeOneToOne(DirectedVertex origin, DirectedVertex destination)	Construct shortest paths from source node to all other nodes in the network based on directed LinkSegment edges
ShortestPathResult	executeOneToOne(DirectedVertex origin, DirectedVertex destination, Set<? extends EdgeSegment> bannedSegments)	Construct shortest paths from source node to all other nodes in the network based on directed LinkSegment edges while imposing custom constraints on certain edge segments not being allowed to be used

Method Detail

executeOneToOne

ShortestPathResult executeOneToOne(DirectedVertex origin,
                                   DirectedVertex destination)

Construct shortest paths from source node to all other nodes in the network based on directed LinkSegment edges

Parameters:

origin - vertex of source node

destination - vertex of sink node

Returns:

shortest path result of the execution

executeOneToOne

ShortestPathResult executeOneToOne(DirectedVertex origin,
                                   DirectedVertex destination,
                                   Set<? extends EdgeSegment> bannedSegments)

Construct shortest paths from source node to all other nodes in the network based on directed LinkSegment edges while imposing custom constraints on certain edge segments not being allowed to be used

Parameters:

origin - vertex of source node

destination - vertex of sink node

bannedSegments - segments not allowed to be used

Returns:

shortest path result of the execution