|
|||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
Interface Summary | |
---|---|
CycleInPredMapDetectionAlg | An algorithm to detect a cycle in a graph given by a predecessor map (occurs as subproblem when negative cycles in shortest path trees shall be identified). |
NegativeCycleDetectionAlg<NumType extends Comparable<NumType>> | A shortest path algorithm which is also able to detected negative cycles |
PathAlgebra<NumType extends Comparable<NumType>> | This interface contains the operations which are needed to calculate the weights of paths in graphs. |
ShortestPathAlg<NumType extends Comparable<NumType>> | The basic interface for the various kinds of shortest path algorithms. |
SingleSourceShortestPathAlg<NumType extends Comparable<NumType>> | Interface for single source shortest path algorithms. |
SingleSourceShortestPathWithNegCycleDetectionAlg<NumType extends Comparable<NumType>> | A single source shortest path algorithm which is able to detected negative cycles |
|
|||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |