org.onlab.graph

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

java.lang.Object

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

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

All Implemented Interfaces:

GraphPathSearch<V,E>

public class KShortestPathsSearch<V extends Vertex,E extends Edge<V>>
extends AbstractGraphPathSearch<V,E>

Runs K shortest paths algorithm on a provided directed graph. Returns results in the form of an InnerOrderedResult so iteration through the returned paths will return paths in ascending order according to the provided EdgeWeight.

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
protected class	KShortestPathsSearch.InnerOrderedResult A result modified to return paths ordered according to the provided comparator.

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
KShortestPathsSearch()

Method Summary

Modifier and Type	Method and Description
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

KShortestPathsSearch

public KShortestPathsSearch()

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.

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