Class Graphs.UnmodifiableTree<V,E>

java.lang.Object

edu.uci.ics.jung.graph.util.Graphs.UnmodifiableAbstractGraph<V,E>

edu.uci.ics.jung.graph.util.Graphs.UnmodifiableGraph<V,E>

edu.uci.ics.jung.graph.util.Graphs.UnmodifiableForest<V,E>

edu.uci.ics.jung.graph.util.Graphs.UnmodifiableTree<V,E>

All Implemented Interfaces:

DirectedGraph<V,E>, Forest<V,E>, Graph<V,E>, Hypergraph<V,E>, Tree<V,E>, Serializable

Enclosing class:

Graphs

static class Graphs.UnmodifiableTree<V,E>
extends Graphs.UnmodifiableForest<V,E>
implements Tree<V,E>, Serializable

Field Summary

Fields inherited from class Graphs.UnmodifiableAbstractGraph

delegate

Constructor Summary

Constructors

Modifier	Constructor	Description
private	UnmodifiableTree(Tree<V,E> delegate)

Method Summary

Modifier and Type	Method	Description
int	getDepth(V vertex)	Returns the (unweighted) distance of vertex from the root of this tree.
int	getHeight()	Returns the maximum depth in this tree.
V	getRoot()	Returns the root of this tree.
Collection<Tree<V,E>>	getTrees()	Returns a view of this graph as a collection of Tree instances.

Methods inherited from class Graphs.UnmodifiableForest

getChildCount, getChildEdges, getChildren, getParent, getParentEdge

Methods inherited from class Graphs.UnmodifiableAbstractGraph

addEdge, addEdge, addEdge, addEdge, addVertex, containsEdge, containsVertex, degree, findEdge, findEdgeSet, getDefaultEdgeType, getDest, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getEndpoints, getIncidentCount, getIncidentEdges, getIncidentVertices, getInEdges, getNeighborCount, getNeighbors, getOpposite, getOutEdges, getPredecessorCount, getPredecessors, getSource, getSuccessorCount, getSuccessors, getVertexCount, getVertices, inDegree, isDest, isIncident, isNeighbor, isPredecessor, isSource, isSuccessor, outDegree, removeEdge, removeVertex

Methods inherited from class Object

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

Methods inherited from interface Forest

getChildCount, getChildEdges, getChildren, getParent, getParentEdge

Methods inherited from interface Graph

addEdge, addEdge, getDest, getEndpoints, getInEdges, getOpposite, getOutEdges, getPredecessorCount, getPredecessors, getSource, getSuccessorCount, getSuccessors, inDegree, isDest, isPredecessor, isSource, isSuccessor, outDegree

Methods inherited from interface Hypergraph

addEdge, addEdge, addVertex, containsEdge, containsVertex, degree, findEdge, findEdgeSet, getDefaultEdgeType, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getIncidentCount, getIncidentEdges, getIncidentVertices, getNeighborCount, getNeighbors, getVertexCount, getVertices, isIncident, isNeighbor, removeEdge, removeVertex

Constructor Details

UnmodifiableTree

private UnmodifiableTree(Tree<V,E> delegate)

Method Details

getDepth

public int getDepth(V vertex)

Description copied from interface: Tree

Returns the (unweighted) distance of vertex from the root of this tree.

Specified by:

getDepth in interface Tree<V,E>

Parameters:

vertex - the vertex whose depth is to be returned.

Returns:

the length of the shortest unweighted path from vertex to the root of this tree

See Also:

• Tree.getHeight()

getHeight

public int getHeight()

Description copied from interface: Tree

Returns the maximum depth in this tree.

Specified by:

getHeight in interface Tree<V,E>

Returns:

the maximum depth in this tree

See Also:

• Tree.getDepth(Object)

getRoot

public V getRoot()

Description copied from interface: Tree

Returns the root of this tree. The root is defined to be the vertex (designated either at the tree's creation time, or as the first vertex to be added) with respect to which vertex depth is measured.

Specified by:

getRoot in interface Tree<V,E>

Returns:

the root of this tree

getTrees

public Collection<Tree<V,E>> getTrees()

Description copied from interface: Forest

Returns a view of this graph as a collection of Tree instances.

Specified by:

getTrees in interface Forest<V,E>

Overrides:

getTrees in class Graphs.UnmodifiableForest<V,E>

Returns:

a view of this graph as a collection of Trees