Unified Typesetting API M1-20040817

de.inghuimische.uta.util
Interface ShortestPathAlgorithm


public interface ShortestPathAlgorithm

A shortest path algorithm searches the shortest possible path between two breakpoints. The distance from one breakpoint to another is defined by the demerits of the line connecting two breakpoints.

Author:
Christian Ziesemer

Method Summary
 List getShortestPath(Breakpoint startVertex, Breakpoint endVertex)
          Returns the shortest path between start and end vertex in form of a list of UTAEdges.
 

Method Detail

getShortestPath

public List getShortestPath(Breakpoint startVertex,
                            Breakpoint endVertex)
Returns the shortest path between start and end vertex in form of a list of UTAEdges.

Parameters:
startVertex - The vertex to start from.
endVertex - The end vertex.
Returns:
The shortest path between start and end vertex in form of a list of UTAEdges.

Unified Typesetting API M1-20040817


An inghuimische.de project.
Copyright (C) 2004 Christian Ziesemer; See the Mozilla Public License for more details.