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 protected ConstrainedPath
computeSimplePath(VertexKey src, VertexKey dst)
-
Methods inherited from class org.opendaylight.algo.impl.AbstractPathComputation
computeP2pPath, getIpv4NodeSid, getIpv6NodeSid, getPathDescription, initializePathComputation, pruneEdge
-
-
-
-
Constructor Detail
-
ShortestPathFirst
public ShortestPathFirst(ConnectedGraph graph)
-
-
Method Detail
-
computeSimplePath
protected ConstrainedPath computeSimplePath(VertexKey src, VertexKey dst)
- Specified by:
computeSimplePath
in classAbstractPathComputation
-
-