Figure 6.

Graph with four possible paths between nodes. While four paths are possible between the nodes in this graph [(a → c → d), (a → c → e), (b → c → d), and (b → c → e)], only two full paths, e.g., (a → c → d) and (b → c → e), are required to capture all of the existing relationships between the nodes.

Rayner et al. BMC Bioinformatics 2006 7:489   doi:10.1186/1471-2105-7-489
Download authors' original image