Flooding algorithm
From HandWiki
Revision as of 13:15, 8 May 2022 by imported>NBrushPhys (correction)
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
- Flooding (computer networking)
- Water retention on mathematical surfaces
- Flood fill
- Spanning tree
- Spanning Tree Protocol
External links