Package org.opendaylight.algo.impl
Class ConstrainedShortestPathFirst
java.lang.Object
org.opendaylight.algo.impl.AbstractPathComputation
org.opendaylight.algo.impl.ConstrainedShortestPathFirst
- All Implemented Interfaces:
org.opendaylight.algo.PathComputationAlgorithm
This Class implements a simple Constrained Shortest Path First path computation algorithm that take into account
Bandwidth and TE Metric as constraints.
- 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 -
Method Summary
Modifier and TypeMethodDescriptionprotected org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.path.computation.rev220324.ConstrainedPathcomputeSimplePath(org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.graph.rev220720.graph.topology.graph.VertexKey src, org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.graph.rev220720.graph.topology.graph.VertexKey dst) Methods inherited from class org.opendaylight.algo.impl.AbstractPathComputation
computeP2pPath, getIpv4NodeSid, getIpv6NodeSid, getPathDescription, initializePathComputation, pruneEdge
-
Constructor Details
-
ConstrainedShortestPathFirst
public ConstrainedShortestPathFirst(org.opendaylight.graph.ConnectedGraph graph)
-
-
Method Details
-
computeSimplePath
protected org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.path.computation.rev220324.ConstrainedPath computeSimplePath(org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.graph.rev220720.graph.topology.graph.VertexKey src, org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.graph.rev220720.graph.topology.graph.VertexKey dst) - Specified by:
computeSimplePathin classAbstractPathComputation
-