e1ff8559e506b92270fa5a1069"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classload__balacing_1_1BinarySearch.html#ad88ebce1ff8559e506b92270fa5a1069">apply</a> (const HornetClass &amp;hornet, const vid_t *d_input, int num_vertices, const Operator &amp;op) const noexcept</td></tr>
<tr class="memdesc:ad88ebce1ff8559e506b92270fa5a1069"><td class="mdescLeft">&#160;</td><td class="mdescRight">Traverse the edges in a vertex