ral.lang
Interface TreeRelationship<FROM,T extends Pair<FROM,FROM>>

All Superinterfaces:
MultiRelationship<FROM,FROM,T>, One2ManyRelationship<FROM,FROM,T>, ReflexiveRelationship<FROM,T>, Relationship<FROM,FROM,T>, UniMultiRelationship<FROM,FROM,T>, UniRelationship<FROM,FROM,T>
All Known Implementing Classes:
TreeHashRel

public interface TreeRelationship<FROM,T extends Pair<FROM,FROM>>
extends ReflexiveRelationship<FROM,T>, One2ManyRelationship<FROM,FROM,T>

A tree relationship is a reflexive relationship with the added constraint that each node can have at most one parent. Thus, it describes general tree structures (also called out-branchings). To be more precise, the relationship does not specify that there is exactly one special root node. Thus, a tree relationship corresponds to a Forest from graph theory.


Method Summary
 
Methods inherited from interface ral.lang.ReflexiveRelationship
clear
 
Methods inherited from interface ral.lang.UniMultiRelationship
add, clearFrom, copyFrom, get, remove, remove
 
Methods inherited from interface ral.lang.Relationship
from, fromPairs, to, toPairs
 
Methods inherited from interface ral.lang.UniMultiRelationship
add, clearFrom, copyFrom, get, remove, remove
 
Methods inherited from interface ral.lang.UniMultiRelationship
add, clearFrom, copyFrom, get, remove, remove