Package org.onlab.graph
Interface GraphPathSearch<V extends Vertex,E extends Edge<V>>
-
- Type Parameters:
V
- vertex typeE
- 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.
-
-
Field Summary
Fields Modifier and Type Field Description static int
ALL_PATHS
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description GraphPathSearch.Result<V,E>
search(Graph<V,E> graph, V src, V dst, EdgeWeigher<V,E> weigher, 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, EdgeWeigher<V,E> weigher, int maxPaths)
Searches the specified graph for paths between vertices.- Parameters:
graph
- graph to be searchedsrc
- optional source vertexdst
- optional destination vertex; if null paths to all vertex destinations will be searchedweigher
- optional edge-weigher; if null,DefaultEdgeWeigher
will be used (assigns equal weights to all links)maxPaths
- limit on number of paths;ALL_PATHS
if no limit- Returns:
- search results
-
-