Uses of Interface org.jungrapht.visualization.spatial.rtree.Node (JunGrapht Visualization 1.1 API)

Packages that use Node
Package Description

org.jungrapht.visualization.spatial.rtree
Visualization mechanisms for supporting RTree spatial data structures.

Uses of Node in org.jungrapht.visualization.spatial.rtree

Classes in org.jungrapht.visualization.spatial.rtree that implement Node
Modifier and Type	Class	Description
`class`	`InnerNode<T>`	a non-leaf node of the R-Tree.
`class`	`LeafNode<T>`	a leaf node of an R-Tree.
`class`	`RTreeNode<T>`	contains the parent for Node implementations

Fields in org.jungrapht.visualization.spatial.rtree with type parameters of type Node
Modifier and Type	Field	Description
`protected Optional<Node<T>>`	RTreeNode.`parent`

Methods in org.jungrapht.visualization.spatial.rtree that return Node
Modifier and Type	Method	Description
`Node<T>`	InnerNode.`add(SplitterContext<T> splitterContext, T element, Rectangle2D bounds)`
`Node<T>`	LeafNode.`add(SplitterContext<T> splitterContext, Map.Entry<T,Rectangle2D> entry)`	add the passed Entry to the map
`Node<T>`	LeafNode.`add(SplitterContext<T> splitterContext, Map.Entry<T,Rectangle2D>... entries)`
`Node<T>`	LeafNode.`add(SplitterContext<T> splitterContext, T element, Rectangle2D bounds)`
`Node<T>`	Node.`add(SplitterContext<T> splitterContext, T element, Rectangle2D bounds)`
`Node<T>`	InnerNode.`get(int i)`	return the ith child node
`Node<T>`	InnerNode.`recalculateBounds()`	recompute the bounding box for this InnerVertex, then the recompute for parent node Climbs the tree to the root as it recalcultes.
`Node<T>`	LeafNode.`recalculateBounds()`	called after a removal.
`Node<T>`	Node.`recalculateBounds()`
`Node<T>`	InnerNode.`remove(T element)`	remove the passed element.
`Node<T>`	LeafNode.`remove(T element)`	remove passed element from the map if it exists call recalculateBounds to update all parent node bounds after removal of the element
`Node<T>`	Node.`remove(T element)`

Methods in org.jungrapht.visualization.spatial.rtree that return types with arguments of type Node
Modifier and Type	Method	Description
`Optional<Node<T>>`	QuadraticSplitter.`chooseSubtree(InnerNode<T> nodeToSplit, T element, Rectangle2D bounds)`
`Optional<Node<T>>`	RStarSplitter.`chooseSubtree(InnerNode<T> nodeToSplit, T element, Rectangle2D bounds)`
`Optional<Node<T>>`	Splitter.`chooseSubtree(InnerNode<T> nodeToSplit, T element, Rectangle2D bounds)`
`List<Node<T>>`	InnerNode.`getChildren()`
`Optional<Node<T>>`	Node.`getParent()`
`Optional<Node<T>>`	RTreeNode.`getParent()`
`Optional<Node<T>>`	RTree.`getRoot()`
`protected Optional<Node<T>>`	AbstractSplitter.`leastEnlargementThenAreaThenKids(InnerNode<T> nodeToSplit, Rectangle2D incoming)`	least area enlargement followed by smallest area followed by fewest child nodes
`protected Optional<Node<T>>`	AbstractSplitter.`leastOverlapThenEnlargementThenAreaThenKids(InnerNode<T> nodeToSplit, Rectangle2D bounds)`	least overlap then least area enlargement followed by smallest area followed by fewest kids

Methods in org.jungrapht.visualization.spatial.rtree with parameters of type Node
Modifier and Type	Method	Description
`static <T> String`	Node.`asString(Node<T> node, String margin)`
`int`	HorizontalEdgeMapEntryComparator.`compare(Node<?> leftVertex, Node<?> rightVertex)`
`int`	HorizontalEdgeNodeComparator.`compare(Node<T> leftVertex, Node<T> rightVertex)`
`int`	VerticalEdgeMapEntryComparator.`compare(Node<?> leftVertex, Node<?> rightVertex)`
`int`	VerticalEdgeNodeComparator.`compare(Node<T> leftVertex, Node<T> rightVertex)`
`static <T> InnerNode<T>`	InnerNode.`create(Node<T> node)`	create a new InnerVertex with one child
`void`	Node.`setParent(Node<T> node)`
`void`	RTreeNode.`setParent(Node<T> node)`
`Pair<InnerNode<T>>`	QuadraticSplitter.`split(List<Node<T>> children, Node<T> newEntry)`
`Pair<InnerNode<T>>`	RStarSplitter.`split(List<Node<T>> children, Node<T> newEntry)`
`Pair<InnerNode<T>>`	Splitter.`split(List<Node<T>> children, Node<T> newEntry)`

Method parameters in org.jungrapht.visualization.spatial.rtree with type arguments of type Node
Modifier and Type	Method	Description
`static <T> InnerNode<T>`	InnerNode.`create(Collection<Node<T>> nodes)`	create a new InnerVertex with the passed nodes as children
`static <T> double`	Node.`nodeArea(Collection<Node<T>> nodes)`
`static <T> double`	Node.`nodeArea(Collection<Node<T>> left, Collection<Node<T>> right)`
`static <T> Rectangle2D`	Node.`nodeBoundingBox(Collection<Node<T>> nodes)`
`static <T> double`	Node.`nodeMargin(Collection<Node<T>> left, Collection<Node<T>> right)`
`static <T> double`	Node.`nodeOverlap(Collection<Node<T>> left, Collection<Node<T>> right)`
`Pair<InnerNode<T>>`	QuadraticSplitter.`split(List<Node<T>> children, Node<T> newEntry)`
`Pair<InnerNode<T>>`	RStarSplitter.`split(List<Node<T>> children, Node<T> newEntry)`
`Pair<InnerNode<T>>`	Splitter.`split(List<Node<T>> children, Node<T> newEntry)`