Jump to content

Flooding algorithm

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by InternetArchiveBot (talk | contribs) at 16:10, 17 December 2019 (Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0). 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