<span class="searchmatch">Borůvka's</span> <span class="searchmatch">algorithm</span> (graph theory) A greedy <span class="searchmatch">algorithm</span> for finding a minimum spanning tree in a graph, or a minimum spanning forest in the case of a graph...
<span class="searchmatch">algorithm</span> Baeza-Yates-Gonnet <span class="searchmatch">algorithm</span> Baeza-Yates–Gonnet <span class="searchmatch">algorithm</span> Baum-Welch <span class="searchmatch">algorithm</span> Bellman-Ford <span class="searchmatch">algorithm</span> Bitap <span class="searchmatch">algorithm</span> <span class="searchmatch">Borůvka's</span> <span class="searchmatch">algorithm</span>...