Skip to content

Commit

Permalink
s
Browse files Browse the repository at this point in the history
  • Loading branch information
jere8184 committed Nov 20, 2024
1 parent 2f851d9 commit 30a5ed3
Showing 1 changed file with 0 additions and 3 deletions.
3 changes: 0 additions & 3 deletions libopenage/datastructure/pairing_heap.h
Original file line number Diff line number Diff line change
Expand Up @@ -234,7 +234,6 @@ class PairingHeap final {
* also known as delete_min.
* _________
* Ω(log log n), O(2^(2*√log log n'))
* caller must eventually either add node back to heap or delete it
*/
T pop() {
if (this->root_node == nullptr) {
Expand Down Expand Up @@ -316,7 +315,6 @@ class PairingHeap final {
return data;
}


/**
* Returns the smallest item on the heap.
* O(1)
Expand Down Expand Up @@ -619,7 +617,6 @@ class PairingHeap final {
#endif
}


/**
* insert a node into the heap.
*/
Expand Down

0 comments on commit 30a5ed3

Please sign in to comment.