Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Parallel breadth-first search
open-in-new
<p>The <a href="/facts/Breadth-first_search/2kulDXCx">breadth-first-search algorithm</a> is a way to explore the vertices of a graph layer by layer. It is a basic algorithm in graph theory which can be used as a part of other graph algorithms. For instance, BFS is used by <a href="/facts/Dinic%27s_algorithm/n8yqcENs">Dinic's algorithm</a> to find maximum flow in a graph. Moreover, BFS is also one of the kernel algorithms in <a href="/facts/Graph500/33k7fPMQ">Graph500</a> benchmark, which is a benchmark for data-intensive supercomputing problems. This article discusses the possibility of speeding up BFS through the use of <a href="/facts/Parallel_computing/nQzcpzQt">parallel computing</a>. </p>