equal
deleted
inserted
replaced
42 ///heap. In case of many calls to these operations, it is better to use a |
42 ///heap. In case of many calls to these operations, it is better to use a |
43 ///\e binary \e heap. |
43 ///\e binary \e heap. |
44 /// |
44 /// |
45 ///\param Item Type of the items to be stored. |
45 ///\param Item Type of the items to be stored. |
46 ///\param Prio Type of the priority of the items. |
46 ///\param Prio Type of the priority of the items. |
47 ///\param ItemIntMap A read and writable Item int map, for the usage of |
47 ///\param ItemIntMap A read and writable Item int map, used internally |
48 ///the heap. |
48 ///to handle the cross references. |
49 ///\param Compare A class for the ordering of the priorities. The |
49 ///\param Compare A class for the ordering of the priorities. The |
50 ///default is \c std::less<Prio>. |
50 ///default is \c std::less<Prio>. |
51 /// |
51 /// |
52 ///\sa BinHeap |
52 ///\sa BinHeap |
53 ///\sa Dijkstra |
53 ///\sa Dijkstra |