Fig. 2From: Computing all hybridization networks for multiple binary phylogenetic input treesAn agreement forest \(\mathcal {F}\) of two phylogenetic \(\mathcal {X}\)-trees T 1 and T 2 together with the corresponding ancestor-descendant graph \(AG(T_{1},T_{2},\mathcal {F})\). Note that, as \(AG(T_{1},T_{2},\mathcal {F})\) does not contain any directed cycles, \(\mathcal {F}\) is acyclicBack to article page