Package edu.uci.ics.jung.graph.util
Class Graphs.SynchronizedTree<V,E>
java.lang.Object
edu.uci.ics.jung.graph.util.Graphs.SynchronizedAbstractGraph<V,E>
edu.uci.ics.jung.graph.util.Graphs.SynchronizedDirectedGraph<V,E>
edu.uci.ics.jung.graph.util.Graphs.SynchronizedForest<V,E>
edu.uci.ics.jung.graph.util.Graphs.SynchronizedTree<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.SynchronizedTree<V,E>
extends Graphs.SynchronizedForest<V,E>
implements Tree<V,E>
-
Field Summary
Fields inherited from class edu.uci.ics.jung.graph.util.Graphs.SynchronizedAbstractGraph
delegate -
Constructor Summary
ConstructorsConstructorDescriptionSynchronizedTree(Tree<V, E> delegate) Creates a new instance based on the provideddelegate. -
Method Summary
Methods inherited from class edu.uci.ics.jung.graph.util.Graphs.SynchronizedForest
getChildCount, getChildEdges, getChildren, getParent, getParentEdge, getTreesMethods inherited from class edu.uci.ics.jung.graph.util.Graphs.SynchronizedDirectedGraph
getDest, getSource, isDest, isSourceMethods inherited from class edu.uci.ics.jung.graph.util.Graphs.SynchronizedAbstractGraph
addEdge, addEdge, addEdge, addEdge, addVertex, containsEdge, containsVertex, degree, findEdge, findEdgeSet, getDefaultEdgeType, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getEndpoints, getIncidentCount, getIncidentEdges, getIncidentVertices, getInEdges, getNeighborCount, getNeighbors, getOpposite, getOutEdges, getPredecessorCount, getPredecessors, getSuccessorCount, getSuccessors, getVertexCount, getVertices, inDegree, isIncident, isNeighbor, isPredecessor, isSuccessor, outDegree, removeEdge, removeVertexMethods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitMethods inherited from interface edu.uci.ics.jung.graph.Forest
getChildCount, getChildEdges, getChildren, getParent, getParentEdge, getTreesMethods inherited from interface edu.uci.ics.jung.graph.Graph
addEdge, addEdge, getDest, getEndpoints, getInEdges, getOpposite, getOutEdges, getPredecessorCount, getPredecessors, getSource, getSuccessorCount, getSuccessors, inDegree, isDest, isPredecessor, isSource, isSuccessor, outDegreeMethods inherited from interface edu.uci.ics.jung.graph.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
-
SynchronizedTree
Creates a new instance based on the provideddelegate.- Parameters:
delegate-
-
-
Method Details
-
getDepth
Description copied from interface:TreeReturns the (unweighted) distance ofvertexfrom the root of this tree. -
getHeight
public int getHeight()Description copied from interface:TreeReturns the maximum depth in this tree. -
getRoot
Description copied from interface:TreeReturns 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.
-