Flooding algorithm: Difference between revisions

Revision as of 23:06, 9 June 2004

Latest revision as of 14:03, 14 July 2025

(79 intermediate revisions by 61 users not shown)

Line 1:

{{Short description|Class of algorithms}}

[[Category:Graph theory]]

{{Notability|date=January 2024}}

A '''flooding algorithm''' is an [[algorithm]] for distributing material to every part of a connected [[network]]. The name derives from the concept of inundation by a [[flood]].

A '''flooding algorithm''' is an [[algorithm]] for distributing material to every part of a [[Graph (discrete mathematics)|graph]]. The name derives from the concept of inundation by a [[flood]]. Flooding algorithms are used in [[Flooding (computer networking)|computer networking]] and [[Flood fill|graphics]]. Flooding algorithms are also useful for solving many mathematical problems, including [[maze]] problems and many problems in [[graph theory]].

Different flooding algorithms can be applied for different problems, and run with different [[time complexities]]. For example, the [[flood fill]] algorithm is a simple but relatively robust algorithm that works for intricate geometries and can determine which part of the (target) area that is [[Glossary of graph theory#Connectivity|connected]] to a given (source) node in a multi-dimensional [[Array data structure|array]], 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 [[jump flooding algorithm]] 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.<ref>{{Cite web |title=What is Flooding Algorithm |url=https://www.igi-global.com/dictionary/flooding-algorithm/11267#:~:text=A%20flooding%20algorithm%20is%20an,part%20of%20some%20routing%20protocols. |website=IGI Global}}</ref><ref>{{Cite web |title=Flooding in Computer Networks |url=https://byjus.com/gate/flooding-in-computer-networks-notes/ |website=Byjus's Exam Prep}}</ref>

Flooding algorithms are used in systems such as [[Usenet]] and [[peer-to-peer]] [[file sharing system]]s and as part of some [[routing protocol]]s, including [[OSPF]], [[DVMRP]], and those used in [[ad-hoc wireless network]]s.

== See also: ==

There are several variants of flooding algorithm: most work roughly as follows.

* [[Flooding (computer networking)]]

#Each node acts as both a transmitter and a receiver.

* [[Water retention on mathematical surfaces]]

#Each node tries to forward every message to every one of its neighbors.

* [[Flood fill]]

This results in every message eventually being delivered to all reachable parts of the network.

* [[Graph traversal]]

* [[Spanning tree]]

* [[Spanning Tree Protocol]]

* [[Amnesiac flooding|Amnesiac Flooding]]

== References ==

Real-world flooding algorithms have to be more complex than this, since precautions have to be taken to avoid wasted duplicate deliveries and infinite loops, and to allow messages to eventually expire from the system.

{{reflist}}

== External links ==

Flooding algorithms are also useful for solving many mathematical problems, including [[maze]] problems and many problems in [[graph theory]].

* [https://arxiv.org/abs/1305.5756 Flooding edge or node weighted graphs, Fernand Meyer]

* [https://web.archive.org/web/20131211173036/http://users.eastlink.ca/~sharrywhite/Download.html Water Retention Utility]

[[Category:Flooding algorithms| ]]

See also:

* [[Bellman flooding algorithm]]

* [[multicast]]