org.onlab.graph

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

java.lang.Object

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

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

All Implemented Interfaces:

GraphPathSearch<V,E>

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

Bellman-Ford graph search algorithm for locating shortest-paths in directed graphs that may contain negative cycles.

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

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

BellmanFordGraphSearch

public BellmanFordGraphSearch()

Method Detail

internalSearch

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

Specified by:

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