Figure 1.

Transitive reduction of an acyclic graph. The edge (a,c) is removed because of the indirect path (a,b,c). Similarly, (a,f) is removed because of the existence of several indirect paths between nodes a and f.

Bošnački et al. BMC Bioinformatics 2012 13:281   doi:10.1186/1471-2105-13-281
Download authors' original image