#include <functional>
#include <vector>
#include <cassert>
Go to the source code of this file.
Classes | |
class | ompl::BinaryHeap< _T, LessThan > |
This class provides an implementation of an updatable min-heap. Using it is a bit cumbersome, as it requires keeping track of the BinaryHeap::Element* type, however, it should be as fast as it gets with an updatable heap. More... | |
class | ompl::BinaryHeap< _T, LessThan >::Element |
When an element is added to the heap, an instance of Element* is created. This instance contains the data that was added and internal information about the position of the data in the heap's internal storage. More... | |
Namespaces | |
namespace | ompl |
Main namespace. Contains everything in this library. |