title: c++ set versus vector + heap operations for an A* priority queue
body: <p>When is using a std::set more efficient (w.r.t. time) than using a std::vector along with <code>make_heap/push_/pop_</code> for the priority queue in an A* operation? My guess is that if the vertices in the open list are small, using a vector is a better option. But does anyone have experience with this?</p>