Class ConstrainedShortestPathFirst

  • All Implemented Interfaces:
    org.opendaylight.algo.PathComputationAlgorithm

    public class ConstrainedShortestPathFirst
    extends AbstractPathComputation
    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
    • Constructor Detail

      • ConstrainedShortestPathFirst

        public ConstrainedShortestPathFirst​(org.opendaylight.graph.ConnectedGraph graph)
    • Method Detail

      • computeP2pPath

        public org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.path.computation.rev200120.ConstrainedPath computeP2pPath​(org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.graph.rev191125.graph.topology.graph.VertexKey src,
                                                                                                                                          org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.graph.rev191125.graph.topology.graph.VertexKey dst,
                                                                                                                                          org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.path.computation.rev200120.PathConstraints cts)
        Specified by:
        computeP2pPath in interface org.opendaylight.algo.PathComputationAlgorithm
        Specified by:
        computeP2pPath in class AbstractPathComputation