std::unordered_multimap::find std::unordered_multimap::get_allocator std::unordered_multimap::hash_function std::unordered_multimap::insert std::unordered_multimap::key_eq std::unordered_multimap::load_factor std::unordered_multimap::max_bucket_count std::unordered_multimap::max_load_factor std:...
Containers library std::priority_queue Defined in header<queue> template< classT, classContainer=std::vector<T>, classCompare=std::less<typenameContainer::value_type> >classpriority_queue; Thepriority queueis acontainer adaptorthat provides constant time lookup of the largest (by default) element,...
int>& par : colores_posibles) {if(par.second < min) {std::set<int>::iterator it = colores_vertice.find(par.first);if(it != colores_vertice.end()) {