Jump to content

Flooding algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Knecht03 (talk | contribs) at 16:56, 22 July 2013 (wrong ref). 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.


References

Flooding edge or node weighted graphs Fernand Meyer http://arxiv.org/abs/1305.5756


Water Retention Utility http://users.eastlink.ca/~sharrywhite/Download.html

Stub icon

This computer science article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Flooding_algorithm&oldid=565352660"