* \b Effects: Assigns \c v to the element handled by \c handle & updates the priority queue. * * \cond * \b Complexity: \f$2^2log(log(N))\f$ (amortized). * \endcond * * \b Complexity: 2**2*log(log(N)) (amortized). * * \b Note: The new value is expected to be less than the current one * */
| 483 | * \b Note: The new value is expected to be less than the current one |
| 484 | * */ |
| 485 | void decrease (handle_type handle, const_reference v) |
| 486 | { |
| 487 | update(handle, v); |
| 488 | } |
| 489 | |
| 490 | /** |
| 491 | * \b Effects: Updates the heap after the element handled by \c handle has been changed. |