Flooding algorithm

From HandWiki
Revision as of 14:15, 8 May 2022 by imported>NBrushPhys (correction)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Short description: Class of algorithms

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