 id="ab4345a99641e219dc355bbf0efbcb0ce"></a>
typedef Traits::Heap&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00255.html#ab4345a99641e219dc355bbf0efbcb0ce">Heap</a></td></tr>
<tr class="memdesc:ab4345a99641e219dc355bbf0efbcb0ce"><td class="mdescLeft">&#160;</td><td class="mdescRight">The heap type used by the algorithm. It maximizes the priorities. <br/></td></tr>
<tr class="separator:ab4345a99641e219dc355bbf0efbcb0ce"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table