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
Class<?>	classE()
Class<?>	classV()
MutableGraph	mutableCopy(Graph<V,E> graph) Creates a mutable copy of an immutable graph.
GraphPathSearch.Result<V,E>	search(Graph<V,E> graph, V src, V dst, EdgeWeight<V,E> weight, int maxPaths) Searches the specified graph for paths between vertices.

Methods inherited from class org.onlab.graph.AbstractGraphPathSearch

checkArguments, samenessThreshold, setSamenessThreshold

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

search

public GraphPathSearch.Result<V,E> search(Graph<V,E> graph,
                                          V src,
                                          V dst,
                                          EdgeWeight<V,E> weight,
                                          int maxPaths)

Description copied from interface: GraphPathSearch

Searches the specified graph for paths between vertices.

Specified by:

search in interface GraphPathSearch<V extends Vertex,E extends Edge<V>>

Overrides:

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

Parameters:

graph - graph to be searched

src - optional source vertex

dst - optional destination vertex; if null paths to all vertex destinations will be searched

weight - optional edge-weight; if null cost of each edge will be assumed to be 1.0

maxPaths - limit on number of paths; GraphPathSearch.ALL_PATHS if no limit

Returns:

search results

classV

public Class<?> classV()

classE

public Class<?> classE()

mutableCopy

public MutableGraph mutableCopy(Graph<V,E> graph)

Creates a mutable copy of an immutable graph.

Parameters:

graph - immutable graph

Returns:

mutable copy