org.onlab.graph

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

All Known Implementing Classes:

AbstractGraphPathSearch.DefaultResult, DepthFirstSearch.SpanningTreeResult, KShortestPathsSearch.InnerOrderedResult

Enclosing interface:

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

public static interface GraphPathSearch.Result<V extends Vertex,E extends Edge<V>>

Abstraction of a path search result.

Method Summary

Modifier and Type	Method and Description
java.util.Map<V,Weight>	costs() Return a bindings of each vertex to its cost in the path.
V	dst() Returns the search destination, if was was given.
java.util.Map<V,java.util.Set<E>>	parents() Returns bindings of each vertex to its parent edges in the path.
java.util.Set<Path<V,E>>	paths() Returns the set of paths produced as a result of the graph search.
V	src() Returns the search source.

Method Detail

src

V src()

Returns the search source.

Returns:

search source

dst

V dst()

Returns the search destination, if was was given.

Returns:

optional search destination

paths

java.util.Set<Path<V,E>> paths()

Returns the set of paths produced as a result of the graph search.

Returns:

set of paths

parents

java.util.Map<V,java.util.Set<E>> parents()

Returns bindings of each vertex to its parent edges in the path.

Returns:

map of vertex to its parent edge bindings

costs

java.util.Map<V,Weight> costs()

Return a bindings of each vertex to its cost in the path.

Returns:

map of vertex to path cost bindings