Flooding algorithm

<p>A flooding algorithm is an <a href="/facts/Algorithm/fnl5NmRt">algorithm</a> for distributing material to every part of a <a href="/facts/Graph_(discrete_mathematics)/kw3eIBUe">graph</a>.  The name derives from the concept of inundation by a <a href="/facts/Flood/FDQjJeXW">flood</a>. Flooding algorithms are used in <a href="/facts/Flooding_(computer_networking)/7mAo7CI2">computer networking</a> and <a href="/facts/Flood_fill/ehcLrEBg">graphics</a>. Flooding algorithms are also useful for solving many mathematical problems, including <a href="/facts/Maze/HQBdjP35">maze</a> problems and many problems in <a href="/facts/Graph_theory/VVPCd4TX">graph theory</a>.
</p><p>Different flooding algorithms can be applied for different problems, and run with different <a href="/facts/Time_complexities/77T62gmf">time complexities</a>. For example, the <a href="/facts/Flood_fill/ehcLrEBg">flood fill</a> algorithm is a simple but relatively robust algorithm that works for intricate geometries and can determine which part of the (target) area that is <a href="/facts/Glossary_of_graph_theory/W0MqKkyE">connected</a> to a given (source) node in a multi-dimensional <a href="/facts/Array_data_structure/BKGvF8AM">array</a>, and is trivially generalized to arbitrary graph structures. If there instead are several source nodes, there are no obstructions in the geometry represented in the multi-dimensional array, and one wishes to segment the area based on which of the source nodes the target nodes are closest to, while the flood fill algorithm can still be used, the <a href="/facts/Jump_flooding_algorithm/GftNfMq8">jump flooding algorithm</a> is potentially much faster as it has a lower time complexity. Unlike the flood fill algorithm, however, the jump flooding algorithm cannot trivially be generalized to unstructured graphs.
</p>

Flooding algorithm open-in-new

Flooding algorithm