Package org.opendaylight.algo.impl

Class ConstrainedShortestPathFirst

java.lang.Object

org.opendaylight.algo.impl.AbstractPathComputation

org.opendaylight.algo.impl.ConstrainedShortestPathFirst

All Implemented Interfaces:

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

Field Summary

Fields inherited from class org.opendaylight.algo.impl.AbstractPathComputation

constraints, graph, pathDestination, pathSource, priorityQueue, processedPath

Constructor Summary

Constructors

Constructor	Description
ConstrainedShortestPathFirst(ConnectedGraph graph)

Method Summary

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

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

ConstrainedShortestPathFirst

public ConstrainedShortestPathFirst(ConnectedGraph graph)

Method Detail

computeSimplePath

protected ConstrainedPath computeSimplePath(VertexKey src,
                                            VertexKey dst)

Specified by:

computeSimplePath in class AbstractPathComputation