net.sf.tweety.commons.util

Class DigraphNode<T>

java.lang.Object

net.sf.tweety.commons.util.DigraphNode<T>

Type Parameters:

T - type of the node's lable

public class DigraphNode<T>
extends java.lang.Object

Author:

Nils Geilen a node in a Digraph

Field Summary

Fields

Modifier and Type	Field and Description
private java.util.Collection<DigraphNode<T>>	children nodes with edges from/to this node
private Digraph<T>	graph the graph this node is part of
private java.util.Collection<DigraphNode<T>>	parents nodes with edges from/to this node
private boolean	uniq graph can contain several nodes with the same label if uniq == false
private T	value the node's label

Constructor Summary

Constructors

Constructor and Description
DigraphNode(Digraph<T> graph, T value, boolean unique)

Method Summary

Modifier and Type	Method and Description
void	addEdge(DigraphNode<T> to) adds an edge from this node to another node
boolean	equals(java.lang.Object obj)
java.util.Collection<DigraphNode<T>>	getChildren() a child is a node n, that has an edge leading from this node to n
DigraphNode<T>	getParent() a parent is a node n, that has an edge leading from n to this node
java.util.Collection<DigraphNode<T>>	getParents() a parent is a node n, that has an edge leading from n to this node
T	getValue()
int	hashCode()
int	inDegree()
boolean	isLeaf() leafs have an outdegree of 0
boolean	isRoot() roots have an indegree of 0
int	outDegree()
java.lang.String	toString()

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Field Detail

value

private T value

the node's label

parents

private java.util.Collection<DigraphNode<T>> parents

nodes with edges from/to this node

children

private java.util.Collection<DigraphNode<T>> children

nodes with edges from/to this node

uniq

private boolean uniq

graph can contain several nodes with the same label if uniq == false

graph

private final Digraph<T> graph

the graph this node is part of

Constructor Detail

DigraphNode

DigraphNode(Digraph<T> graph,
            T value,
            boolean unique)

Method Detail

inDegree

public int inDegree()

Returns:

the number of edges pointing to this node

outDegree

public int outDegree()

Returns:

the umber of edges pointing away from this node

getValue

public T getValue()

Returns:

the node's lable

getParents

public java.util.Collection<DigraphNode<T>> getParents()

a parent is a node n, that has an edge leading from n to this node

Returns:

all of this node's parents

getParent

public DigraphNode<T> getParent()

a parent is a node n, that has an edge leading from n to this node

Returns:

one of this node's parents

getChildren

public java.util.Collection<DigraphNode<T>> getChildren()

a child is a node n, that has an edge leading from this node to n

Returns:

all of the nodes children

addEdge

public void addEdge(DigraphNode<T> to)

adds an edge from this node to another node

Parameters:

to - the node the adge points to

isRoot

public boolean isRoot()

roots have an indegree of 0

Returns:

whether this node is the root of a tree

isLeaf

public boolean isLeaf()

leafs have an outdegree of 0

Returns:

whether this node is a leaf of a tree

hashCode

public int hashCode()

Overrides:

hashCode in class java.lang.Object

equals

public boolean equals(java.lang.Object obj)

Overrides:

equals in class java.lang.Object

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object