Flooding algorithm
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.
External links
- Water retention on mathematical surfaces
- Flooding edge or node weighted graphs, Fernand Meyer
- Water Retention Utility
This article is issued from Wikipedia - version of the 6/29/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.