Figure 3

The breakpoint graph$B\left(\mathcal{G},\mathcal{A}\right)$ with possible edges to be added to the adjacencies of $\mathcal{ G}$. Breakpoint graph $B\left(\mathcal{G},\mathcal{A}\right)$ consisting of paths and cycles. Thick edges are in $A\left(\mathcal{A}\right)$, and thin edges are in $A\left(\mathcal{G}\right)$. Dashed edges are the edges that should be added to $A\left(\mathcal{G}\right)$ for the paths whose first and last edges are in $A\left(\mathcal{A}\right)$.