Scaffolding  0.1
This program can assemble genome scaffolds using the pairing information in paired-end reads.
Classes
low_priority_queue.hpp File Reference
#include <list>
#include <map>

Go to the source code of this file.

Classes

class  std::low_priority_queue< Element, Priority >
 a low-priority queue of Elements with Priorities More...
 

Detailed Description

implementation of a priority queue taking O(n+k) space where k is the maximum priority & n is the number of elements in the queue and the following times: construct: O(1) insert: O(log k) (amortized) erase (by iterator): O(log k) change_priority (by iterator): O(log k) get_min, get_max: O(1) pop_min, pop_max: O(1)