Class find_embedding::pairing_node

template<typename N>
class pairing_node : public N

Public Functions

pairing_node<N> *merge_roots(pairing_node<N> *other)

the basic operation of the pairing queue put this and other into heap-order