Figure 2
From: Computing paths and cycles in biological interaction graphs
The graph of Figure 1d transformed for the calculation of shortest paths with the two-step algorithm (TSA). The positive edges X → X' (X ∈ {A, B, C, G, H, F}) with zero weight are not displayed to reduce clutter (cf. Additional file 2). The shortest negative path from A to B is A → H' → C → B' with a length of 5. Note that the lengths of the (shortest) cycles is computed during the exhaustive search and not displayed in this transformed (acyclic) graph.