Uses of Interface
org.onlab.graph.GraphPathSearch.Result

Packages that use GraphPathSearch.Result

Package	Description
org.onlab.graph	Graph abstractions and graph path finding algorithms.

Uses of GraphPathSearch.Result in org.onlab.graph

Classes in org.onlab.graph that implement GraphPathSearch.Result

Modifier and Type	Class and Description
protected class	AbstractGraphPathSearch.DefaultResult Default path search result that uses the DefaultPath to convey paths in a graph.
class	DepthFirstSearch.SpanningTreeResult Graph search result which includes edge classification for building a spanning tree.
protected class	KShortestPathsSearch.InnerOrderedResult A result modified to return paths ordered according to the provided comparator.

Methods in org.onlab.graph that return GraphPathSearch.Result

Modifier and Type	Method and Description
GraphPathSearch.Result<V,E>	SuurballeGraphSearch.search(Graph<V,E> graph, V src, V dst, EdgeWeight<V,E> weight, int maxPaths)
GraphPathSearch.Result<V,E>	SrlgGraphSearch.search(Graph<V,E> graph, V src, V dst, EdgeWeight<V,E> weight, int maxPaths)
GraphPathSearch.Result<V,E>	KShortestPathsSearch.search(Graph<V,E> graph, V src, V dst, EdgeWeight<V,E> weight, int maxPaths)
GraphPathSearch.Result<V,E>	GraphPathSearch.search(Graph<V,E> graph, V src, V dst, EdgeWeight<V,E> weight, int maxPaths) Searches the specified graph for paths between vertices.
GraphPathSearch.Result<V,E>	DijkstraGraphSearch.search(Graph<V,E> graph, V src, V dst, EdgeWeight<V,E> weight, int maxPaths)
GraphPathSearch.Result<V,E>	BreadthFirstSearch.search(Graph<V,E> graph, V src, V dst, EdgeWeight<V,E> weight, int maxPaths)
GraphPathSearch.Result<V,E>	BellmanFordGraphSearch.search(Graph<V,E> graph, V src, V dst, EdgeWeight<V,E> weight, int maxPaths)