Graphviz 12.1.0~dev.20240716.1117
|
#include <vector>
#include <list>
#include <vpsc/pairingheap/dsexceptions.h>
#include <vpsc/pairingheap/PairingHeap.h>
Go to the source code of this file.
Macros | |
#define | PAIRING_HEAP_CPP |
Pairing heap datastructure implementation. | |
Functions | |
template<class T > | |
ostream & | operator<< (ostream &os, const PairingHeap< T > &b) |
#define PAIRING_HEAP_CPP |
Based on example code in "Data structures and Algorithm Analysis in C++" by Mark Allen Weiss, used and released under the LGPL by permission of the author.
No promises about correctness. Use at your own risk!
Authors: Mark Allen Weiss Tim Dwyer tgdwy.nosp@m.er@g.nosp@m.mail..nosp@m.com
Copyright (C) 2005 Authors
This version is released under the CPL (Common Public License) with the Graphviz distribution. A version is also available under the LGPL as part of the Adaptagrams project: https://github.com/mjwybrow/adaptagrams.
If you make improvements or bug fixes to this code it would be much appreciated if you could also contribute those changes back to the Adaptagrams repository.
Definition at line 31 of file PairingHeap.cpp.
ostream & operator<< | ( | ostream & | os, |
const PairingHeap< T > & | b | ||
) |
Definition at line 218 of file PairingHeap.cpp.