uk.ac.manchester.cs.bhig.util

Interface Tree<N>

Type Parameters:

N - the kind of elements in the tree

All Known Implementing Classes:

EntailedAxiomTree, ExplanationTree, MutableTree

public interface Tree<N>

Author: Matthew Horridge
The University Of Manchester
Bio-Health Informatics Group
Date: 22-Jan-2008

Method Summary

Methods

Modifier and Type	Method and Description
void	dump(PrintWriter writer)
void	dump(PrintWriter writer, int indent)
List<N>	fillDepthFirst()
int	getChildCount() A convenience method that gets the number of child nodes that this node has.
List<Tree<N>>	getChildren() Gets the children of this tree node.
Object	getEdge(Tree<N> child)
Tree<N>	getParent() Gets the parent of this tree node.
List<Tree<N>>	getPathToRoot()
Tree<N>	getRoot() A convenience method that gets the root of this tree.
N	getUserObject() Gets the "content" of this tree node.
Set<N>	getUserObjectClosure()
List<N>	getUserObjectPathToRoot()
boolean	isLeaf() A convenience method that determines if this node is a leaf node (because it has no children).
boolean	isRoot() A convenience method that determines if this is a root node (because it has no parent node)
void	setNodeRenderer(NodeRenderer<N> renderer)
void	sortChildren(Comparator<Tree<N>> comparator) Sorts the children using the specified comparator

Method Detail

getUserObject

N getUserObject()

Gets the "content" of this tree node.

Returns:

The user content of this node.

getParent

Tree<N> getParent()

Gets the parent of this tree node.

Returns:

The parent tree node, or null if this node doesn't have a parent.

getChildren

List<Tree<N>> getChildren()

Gets the children of this tree node.

Returns:

A list of children. If this tree node doesn't have any children then the list will be empty.

getEdge

Object getEdge(Tree<N> child)

Parameters:

child - the child to use

Returns:

the object stored as edge

sortChildren

void sortChildren(Comparator<Tree<N>> comparator)

Sorts the children using the specified comparator

Parameters:

comparator - The comparator to be used for the sorting.

getChildCount

int getChildCount()

A convenience method that gets the number of child nodes that this node has.

Returns:

The count of the number of children of this node.

isRoot

boolean isRoot()

A convenience method that determines if this is a root node (because it has no parent node)

Returns:

true if this is a root node, otherwise false.

isLeaf

boolean isLeaf()

A convenience method that determines if this node is a leaf node (because it has no children).

Returns:

true if this node is a leaf node otherwise false.

getRoot

Tree<N> getRoot()

A convenience method that gets the root of this tree.

Returns:

The root node, which could be this node.

getPathToRoot

List<Tree<N>> getPathToRoot()

Returns:

the path to the root

getUserObjectPathToRoot

List<N> getUserObjectPathToRoot()

Returns:

the elements in the path to root

dump

void dump(PrintWriter writer)

Parameters:

writer - the writer to print to

dump

void dump(PrintWriter writer,
        int indent)

Parameters:

writer - the writer to print to

indent - how much to indent

setNodeRenderer

void setNodeRenderer(NodeRenderer<N> renderer)

Parameters:

renderer - the renderer to use

getUserObjectClosure

Set<N> getUserObjectClosure()

Returns:

the set of user objects

fillDepthFirst

List<N> fillDepthFirst()

Returns:

the list of elements