Interval Heap vs MinHeap

Jump to navigation Jump to search
Revision as of 20 July 2013 at 06:38.
This is the thread's initial revision.

Interval Heap vs MinHeap

I'm curious, why did you go with the MinHeap instead of the IntervalHeap for your path ordering? Surely IntervalHeap can be kept pruned and small, resulting in less overhead?

    Skilgannon (talk)‎08:38, 20 July 2013
    Retrieved from "http://robowiki.net/wiki/Thread:User_talk:Rednaxela/kD-Tree/Interval_Heap_vs_MinHeap"