Package org.opendaylight.algo.impl
Class ShortestPathFirst
- java.lang.Object
-
- org.opendaylight.algo.impl.AbstractPathComputation
-
- org.opendaylight.algo.impl.ShortestPathFirst
-
- All Implemented Interfaces:
PathComputationAlgorithm
public class ShortestPathFirst extends AbstractPathComputation
This Class implements a simple Shortest Path First path computation algorithm based on standard IGP Metric.- Author:
- Olivier Dugeon, Philippe Niger, Philippe Cadro
-
-
Field Summary
-
Fields inherited from class org.opendaylight.algo.impl.AbstractPathComputation
constraints, graph, pathDestination, pathSource, priorityQueue, processedPath
-
-
Constructor Summary
Constructors Constructor Description ShortestPathFirst(ConnectedGraph graph)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description ConstrainedPath
computeP2pPath(VertexKey src, VertexKey dst, PathConstraints cts)
Compute Point to Point Path from source to destination taking into account constraints.-
Methods inherited from class org.opendaylight.algo.impl.AbstractPathComputation
getIpv4NodeSid, getIpv6NodeSid, getPathDescription, initializePathComputation, pruneEdge
-
-
-
-
Constructor Detail
-
ShortestPathFirst
public ShortestPathFirst(ConnectedGraph graph)
-
-
Method Detail
-
computeP2pPath
public ConstrainedPath computeP2pPath(VertexKey src, VertexKey dst, PathConstraints cts)
Description copied from interface:PathComputationAlgorithm
Compute Point to Point Path from source to destination taking into account constraints.- Specified by:
computeP2pPath
in interfacePathComputationAlgorithm
- Specified by:
computeP2pPath
in classAbstractPathComputation
- Parameters:
src
- Source Vertex Keydst
- Destination Vertex Keycts
- Constraints (Metric, TE Metric, Delay, Jitter, Loss, Bandwidth)- Returns:
- A Path that meet constraints or empty path otherwise. ConstrainedPath.Status indicates the result of the path computation (Completed or Failed)
-
-