Timeline for Indexed Fibonacci heap implementation
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 18, 2017 at 10:21 | comment | added | ewcz |
ah, sorry, I forgot to mention it, the statement throw std::runtime_error("key is greater"); is commented out in the gist (it was then easier to test since then I could just randomly generate items to insert as well as operations to perform without keeping track of the items)...
|
|
| Apr 18, 2017 at 10:08 | comment | added | MAG | I think i found the error, Let me know if you found something else. Also your example throws a std::runtime_error because you are incrementing a priority. Thanks | |
| Apr 18, 2017 at 10:04 | history | edited | MAG | CC BY-SA 3.0 |
added 722 characters in body
|
| Apr 18, 2017 at 7:58 | comment | added | ewcz | ok, I have prepared an example | |
| Apr 17, 2017 at 10:23 | comment | added | ewcz |
hmm, it seems to segfault in some cases even with the modified cut method, I would have a "test example" for this in case you are interested...
|
|
| Apr 16, 2017 at 11:44 | history | edited | MAG | CC BY-SA 3.0 |
edited body
|
| Apr 16, 2017 at 11:14 | history | answered | MAG | CC BY-SA 3.0 |