Skip to main content

Advertisement

Figure 2 | Algorithms for Molecular Biology

Figure 2

From: A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs

Figure 2

Dijkstra’s algorithms running times. Running times for each version of Dijkstra’s algorithm: using Fibonacci heaps (FIB), using radix heaps (RAD), using binary heaps (BIN) and using binary heaps without the decrease-key operation (BIN-NO-DEC). The tests were done including all BCCs with more than 150 vertices. Both axes are in logarithmic scale. The results for the largest BCC were omitted from the plot to improve the visualization. It took 942.15 s for FIB and 419.84 s for BIN-NO-DEC.

Back to article page