min_heap.h File Reference

#include <queue>
#include <vector>
#include <functional>

Go to the source code of this file.

Namespaces
namespace	igl

Typedefs
template<class T >
using	igl::min_heap = std::priority_queue< T, std::vector< T >, std::greater< T > >
	Templated min heap (reverses sort order of std::priority_queue)