Package org.onlab.graph

Class DepthFirstSearch.SpanningTreeResult

java.lang.Object

org.onlab.graph.AbstractGraphPathSearch.DefaultResult

org.onlab.graph.DepthFirstSearch.SpanningTreeResult

All Implemented Interfaces:

GraphPathSearch.Result<V,E>

Enclosing class:

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

public class DepthFirstSearch.SpanningTreeResult
extends AbstractGraphPathSearch.DefaultResult

Graph search result which includes edge classification for building a spanning tree.

Field Summary

Fields

Modifier and Type	Field	Description
protected Map<E,DepthFirstSearch.EdgeType>	edges

Fields inherited from class org.onlab.graph.AbstractGraphPathSearch.DefaultResult

costs, maxPaths, parents, paths

Constructor Summary

Constructors

Constructor	Description
SpanningTreeResult(V src, V dst, int maxPaths)	Creates a new spanning tree result.

Method Summary

Modifier and Type	Method	Description
Map<E,DepthFirstSearch.EdgeType>	edges()	Returns the map of edge type.

Methods inherited from class org.onlab.graph.AbstractGraphPathSearch.DefaultResult

buildPaths, costs, dst, parents, paths, src

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

edges

protected final Map<E extends Edge<V>,DepthFirstSearch.EdgeType> edges

Constructor Detail

SpanningTreeResult

public SpanningTreeResult(V src,
                          V dst,
                          int maxPaths)

Creates a new spanning tree result.

Parameters:

src - search source

dst - optional search destination

maxPaths - limit on the number of paths

Method Detail

edges

public Map<E,DepthFirstSearch.EdgeType> edges()

Returns the map of edge type.

Returns:

edge to edge type bindings