Class ConstrainedShortestPathFirst

java.lang.Object
org.opendaylight.algo.impl.AbstractPathComputation
org.opendaylight.algo.impl.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 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:
      computeSimplePath in class AbstractPathComputation