org.onlab.graph

Interface GraphPathSearch<V extends Vertex,E extends Edge<V>>

Type Parameters:

V - vertex type

E - edge type

All Known Implementing Classes:

AbstractGraphPathSearch, BellmanFordGraphSearch, BreadthFirstSearch, DepthFirstSearch, DijkstraGraphSearch, KShortestPathsSearch, SrlgGraphSearch, SuurballeGraphSearch

public interface GraphPathSearch<V extends Vertex,E extends Edge<V>>

Representation of a graph path search algorithm.

Nested Class Summary

Nested Classes

Modifier and Type	Interface and Description
static interface	GraphPathSearch.Result<V extends Vertex,E extends Edge<V>> Abstraction of a path search result.

Field Summary

Fields

Modifier and Type	Field and Description
static int	ALL_PATHS

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.

Field Detail

ALL_PATHS

static final int ALL_PATHS

See Also:

Constant Field Values

Method Detail

search

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.

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; ALL_PATHS if no limit

Returns:

search results