search

theodesp / go-heaps

Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci
MIT License
97 stars 29 forks source link

Add Adjust, Delete and Meld for Fibonacci Heap #28

Open theodesp opened 6 years ago

theodesp commented 6 years ago

Fibonacci Heap needs to implement the Extended interfaces

abhishekjhaji commented 4 years ago

For fibonacci Heap don't you think Delete(node *Node) Item would be more meaningful than Delete(item Item) Item? If you agree I can raise a PR for the same.