|
|||||||||
PREV NEXT | FRAMES NO FRAMES |
Accessor
is the interface that embodies this concept.(DEFAULT_MAX_LEVEL+1)
forward links.
(DEFAULT_MAX_LEVEL+1)
forward links.
(maxLevel+1)
forward links.
node
in order.
java.util.Comparator
and adapts it to the
jdsl.core.api.Comparator
.java.util.Comparator
.
Comparator
and reverses the
ordering with respect to which the elements are compared.compareTo
method of x1
on
x2
.
a
node
, and replaces
this position with an external node with a null element.
attr
, from the decorable object.
v
Position
s that are edges.Edge.NONE
vertices()
+
elements()
in the subgraph.
Face.NONE
key
.
attr
, in this decorable object.
subtreeRoot
of this binary tree is demoted
one level, with all the positions and elements unchanged, and
becomes the right child of a new node storing the given element.
subtreeRoot
of this binary tree is demoted
one level, with all the positions and elements unchanged, and
becomes the left child of a new node, storing the given element.
jdsl.graph.api
package.node
as the first child.
BinaryTree
interface.CircularSequence
.Container
for more details.KeyBasedContainer
.PositionalContainer
.Sequence
.InspectableGraph
.Tree
Edge
s is somehow incorrect.compare(o,o)
jdsl.geomobj.api
.jdsl.map.api
.newSubtree
at external node
node
by replacing node
with the root of
newSubtree
.
t
at external node extNode
by replacing ExtNode
with the root of t
.
e
as being of type kind
.
v
as being of depth depth
in the BFS
tree created by this BFS.
Locator
is returned when a method that should
return a locator with a given key can find no such key within
the data structure
Edge
object
with certain properties does not exist in the graph.Vertex
object with certain properties does not exist in the graph.node
is deleted, and the sibling of
node
, with all its children, is installed in its
place; node
is also deleted.
node
with the tree
t
.
Vertex.NONE
|
|||||||||
PREV NEXT | FRAMES NO FRAMES |