V
- the vertex typeE
- the edge typepublic class DelegateForest<V,E>
extends edu.uci.ics.jung.graph.GraphDecorator<V,E>
implements edu.uci.ics.jung.graph.Forest<V,E>
Forest
that delegates to a specified DirectedGraph
instance.Constructor and Description |
---|
DelegateForest()
Creates an instance backed by a new
DirectedSparseGraph instance. |
DelegateForest(edu.uci.ics.jung.graph.DirectedGraph<V,E> delegate)
Creates an instance backed by the input
DirectedGraph i |
Modifier and Type | Method and Description |
---|---|
boolean |
addEdge(E edge,
java.util.Collection<? extends V> vertices) |
boolean |
addEdge(E e,
V v1,
V v2,
edu.uci.ics.jung.graph.util.EdgeType edgeType)
Add an edge to the tree, connecting v1, the parent and v2, the child.
|
void |
addTree(edu.uci.ics.jung.graph.Tree<V,E> tree)
Adds
tree to this graph as an element of this forest. |
boolean |
addVertex(V vertex)
Add vertex as a root of the tree
|
int |
getChildCount(V vertex) |
java.util.Collection<E> |
getChildEdges(V vertex) |
java.util.Collection<V> |
getChildren(V v)
Returns the children of
v . |
int |
getDepth(V v)
computes and returns the depth of the tree from the
root to the passed vertex
|
int |
getHeight()
computes and returns the height of the tree
|
int |
getIncidentCount(E edge) |
V |
getParent(V child) |
E |
getParentEdge(V vertex) |
java.util.List<V> |
getPath(V child)
returns an ordered list of the nodes beginning at the root
and ending at the passed child node, including all intermediate
nodes.
|
V |
getRoot()
getter for the root of the tree
returns null, as this tree has >1 roots
|
java.util.Collection<V> |
getRoots()
Returns the root of each tree of this forest as a
Collection . |
java.util.Collection<edu.uci.ics.jung.graph.Tree<V,E>> |
getTrees() |
boolean |
isInternal(V v)
computes and returns whether the passed node is
neither the root, nor a leaf node.
|
boolean |
isLeaf(V v)
Returns true if
v has no child nodes. |
boolean |
isRoot(V v)
Returns true if
v has no parent node. |
boolean |
removeChild(V orphan)
removes a node from the tree, causing all descendants of
the removed node also to be removed
|
boolean |
removeEdge(E edge)
Removes
edge from this tree, and the subtree rooted
at the child vertex incident to edge . |
boolean |
removeEdge(E edge,
boolean remove_subtree)
Removes
edge from this tree. |
boolean |
removeVertex(V vertex)
Removes
vertex from this tree, and the subtree
rooted at vertex . |
boolean |
removeVertex(V vertex,
boolean remove_subtrees)
Removes
vertex from this tree. |
void |
setRoot(V root)
adds root as a root of the tree
|
addEdge, addEdge, containsEdge, containsVertex, degree, findEdge, findEdgeSet, getDefaultEdgeType, getDest, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getEndpoints, getIncidentEdges, getIncidentVertices, getInEdges, getNeighborCount, getNeighbors, getOpposite, getOutEdges, getPredecessorCount, getPredecessors, getSource, getSuccessorCount, getSuccessors, getVertexCount, getVertices, inDegree, isDest, isIncident, isNeighbor, isPredecessor, isSource, isSuccessor, outDegree
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
addEdge, getDest, getEndpoints, getInEdges, getOpposite, getOutEdges, getPredecessorCount, getPredecessors, getSource, getSuccessorCount, getSuccessors, inDegree, isDest, isPredecessor, isSource, isSuccessor, outDegree
addEdge, containsEdge, containsVertex, degree, findEdge, findEdgeSet, getDefaultEdgeType, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getIncidentEdges, getIncidentVertices, getNeighborCount, getNeighbors, getVertexCount, getVertices, isIncident, isNeighbor
public DelegateForest()
DirectedSparseGraph
instance.public boolean addEdge(E e, V v1, V v2, edu.uci.ics.jung.graph.util.EdgeType edgeType)
addEdge
in interface edu.uci.ics.jung.graph.Graph<V,E>
addEdge
in class edu.uci.ics.jung.graph.GraphDecorator<V,E>
e
- a unique edge to addv1
- the parent nodev2
- the child nodeedgeType
- should be EdgeType.DIRECTEDGraph.addEdge(java.lang.Object, java.lang.Object, java.lang.Object, edu.uci.ics.jung.graph.util.EdgeType)
public boolean addVertex(V vertex)
public boolean removeEdge(E edge)
edge
from this tree, and the subtree rooted
at the child vertex incident to edge
.
(The subtree is removed to ensure that the tree in which the edge
was found is still a tree rather than a forest. To change this
behavior so that thepublic boolean removeEdge(E edge, boolean remove_subtree)
edge
from this tree.
If remove_subtree
is true
, removes
the subtree rooted at the child vertex incident to edge
.
Otherwise, leaves the subtree intact as a new component tree of this
forest.edge
- the edge to removeremove_subtree
- if true
, remove the subtreetrue
iff the tree was modifiedpublic boolean removeVertex(V vertex)
vertex
from this tree, and the subtree
rooted at vertex
.public boolean removeVertex(V vertex, boolean remove_subtrees)
vertex
from this tree.
If remove_subtrees
is true
, removes
the subtrees rooted at the children of vertex
.
Otherwise, leaves these subtrees intact as new component trees of this
forest.vertex
- the vertex to removeremove_subtrees
- if true
, remove the subtrees
rooted at vertex
's childrentrue
iff the tree was modifiedpublic java.util.List<V> getPath(V child)
child
- the last node in the path from the rootpublic V getRoot()
public void setRoot(V root)
root
- the initial tree rootpublic boolean removeChild(V orphan)
orphan
- the node to removepublic int getDepth(V v)
v
- the node who's depth is computedpublic int getHeight()
public boolean isInternal(V v)
true
if v
is neither a leaf
nor a rootpublic boolean isLeaf(V v)
v
has no child nodes.public boolean isRoot(V v)
v
has no parent node.public int getIncidentCount(E edge)
public java.util.Collection<V> getRoots()
Collection
.public void addTree(edu.uci.ics.jung.graph.Tree<V,E> tree)
tree
to this graph as an element of this forest.tree
- the tree to add to this forest as a componentpublic int getChildCount(V vertex)