org.onlab.graph

Class SuurballeGraphSearch<V extends Vertex,E extends Edge<V>>

java.lang.Object

org.onlab.graph.AbstractGraphPathSearch<V,E>

org.onlab.graph.DijkstraGraphSearch<V,E>

org.onlab.graph.SuurballeGraphSearch<V,E>

All Implemented Interfaces:

GraphPathSearch<V,E>

public class SuurballeGraphSearch<V extends Vertex,E extends Edge<V>>
extends DijkstraGraphSearch<V,E>

Suurballe shortest-path graph search algorithm capable of finding both a shortest path, as well as a backup shortest path, between a source and a destination such that the sum of the path lengths is minimized.

Nested Class Summary

Nested classes/interfaces inherited from class org.onlab.graph.AbstractGraphPathSearch

AbstractGraphPathSearch.DefaultResult

Nested classes/interfaces inherited from interface org.onlab.graph.GraphPathSearch

GraphPathSearch.Result<V extends Vertex,E extends Edge<V>>

Field Summary

Fields inherited from interface org.onlab.graph.GraphPathSearch

ALL_PATHS

Constructor Summary

Constructors

Constructor and Description
SuurballeGraphSearch()

Method Summary

Modifier and Type	Method and Description
protected GraphPathSearch.Result<V,E>	internalSearch(Graph<V,E> graph, V src, V dst, EdgeWeigher<V,E> weigher, int maxPaths)

Methods inherited from class org.onlab.graph.AbstractGraphPathSearch

checkArguments, search

Methods inherited from class java.lang.Object

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

Constructor Detail

SuurballeGraphSearch

public SuurballeGraphSearch()

Method Detail

internalSearch

protected GraphPathSearch.Result<V,E> internalSearch(Graph<V,E> graph,
                                                     V src,
                                                     V dst,
                                                     EdgeWeigher<V,E> weigher,
                                                     int maxPaths)

Overrides:

internalSearch in class DijkstraGraphSearch<V extends Vertex,E extends Edge<V>>