By the acyclicity of the WordNet hypernymy structure, the process yields a proper DAG.
the output contains redundant links (direct ones and transitive ones connecting the same pair of phrases); these are subsequently eliminated by a transitive reduction algorithm (Aho et al., 1972).