Flooding algorithm: Difference between revisions

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

• Flooding (computer networking)
• Water retention on mathematical surfaces
• Flood fill
• Spanning tree
• Spanning Tree Protocol

External links

• Flooding edge or node weighted graphs, Fernand Meyer
• Water Retention Utility