Flooding algorithm
From Infogalactic: the planetary knowledge core
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
<templatestyles src="Asbox/styles.css"></templatestyles>
 |
This computer science article is a stub. You can help Wikipedia by expanding it. |
