/* -*- mode: C++; indent-tabs-mode: nil; -*-

 /* -*- mode: C++; indent-tabs-mode: nil; -*-

  *

  *

  * This file is a part of LEMON, a generic C++ optimization library.

  * This file is a part of LEMON, a generic C++ optimization library.

  *

  *

  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

  * (Egervary Research Group on Combinatorial Optimization, EGRES).

  * (Egervary Research Group on Combinatorial Optimization, EGRES).

  *

  *

  * Permission to use, modify and distribute this software is granted

  * Permission to use, modify and distribute this software is granted

  * provided that this copyright notice appears in all copies. For

  * provided that this copyright notice appears in all copies. For

   /// this class stores only simply-linked lists. It supports erasing

   /// this class stores only simply-linked lists. It supports erasing

   /// only for the item having minimum priority and it does not support

   /// only for the item having minimum priority and it does not support

   /// key increasing and decreasing.

   /// key increasing and decreasing.

   ///

   ///

   /// Note that this implementation does not conform to the

   /// Note that this implementation does not conform to the

   /// functionality.

   /// functionality.

   ///

   ///

   /// \tparam IM A read-writable item map with \c int values, used

   /// \tparam IM A read-writable item map with \c int values, used

   /// internally to handle the cross references.

   /// internally to handle the cross references.

   /// \tparam MIN Indicate if the heap is a \e min-heap or a \e max-heap.

   /// \tparam MIN Indicate if the heap is a \e min-heap or a \e max-heap.