org.onlab.graph

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

java.lang.Object

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

public class LazyKShortestPathsSearch<V extends Vertex,E extends Edge<V>>
extends Object

Lazily runs K shortest paths algorithm on a provided directed graph.

Constructor Summary

Constructors

Constructor and Description
LazyKShortestPathsSearch()

Method Summary

Modifier and Type	Method and Description
Stream<Path<V,E>>	lazyPathSearch(Graph<V,E> graph, V src, V dst, EdgeWeigher<V,E> weigher) Searches the specified graph for paths between vertices.

Methods inherited from class java.lang.Object

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

Constructor Detail

LazyKShortestPathsSearch

public LazyKShortestPathsSearch()

Method Detail

lazyPathSearch

public Stream<Path<V,E>> lazyPathSearch(Graph<V,E> graph,
                                        V src,
                                        V dst,
                                        EdgeWeigher<V,E> weigher)

Searches the specified graph for paths between vertices.

Parameters:

graph - graph to be searched

src - source vertex

dst - destination vertex

weigher - edge-weigher

Returns:

Stream of shortest paths