Acyclic text graphs



If Node N1 contains Anchor A1 and Node N2 is a target of Edge E1 
   and Anchor A1 is a target of Edge E1
then Node N1 Includes immediately Node N2.
Transitive closure of Includes immediately is Includes.
A Text graph having no Node that Includes itself is an Acyclic Text Graph.