Jump to content

Flooding algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Kri (talk | contribs) at 18:26, 16 January 2022 (Updated categories). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A flooding algorithm is an algorithm for distributing material to every part of a graph. The name derives from the concept of inundation by a flood.

Flooding algorithms are used in computer networking and graphics. Flooding algorithms are also useful for solving many mathematical problems, including maze problems and many problems in graph theory.

See also