Flooding algorithm - Revision history

SolxrgashiUnited: adding sources

2025-01-26T18:11:21Z

adding sources

← Previous revision		Revision as of 18:11, 26 January 2025
Line 1:		Line 1:
	{{Short description\|Class of algorithms}}		{{Short description\|Class of algorithms}}
	{{Multiple issues\|		{{Multiple issues\|{{Notability\|date=January 2024}}}}
	{{Notability\|date=January 2024}}
	{{Unreferenced\|date=January 2024}}
	}}
	A '''flooding algorithm''' is an [[algorithm]] for distributing material to every part of a [[Graph (discrete mathematics)\|graph]]. The name derives from the concept of inundation by a [[flood]]. Flooding algorithms are used in [[Flooding (computer networking)\|computer networking]] and [[Flood fill\|graphics]]. Flooding algorithms are also useful for solving many mathematical problems, including [[maze]] problems and many problems in [[graph theory]].		A '''flooding algorithm''' is an [[algorithm]] for distributing material to every part of a [[Graph (discrete mathematics)\|graph]]. The name derives from the concept of inundation by a [[flood]]. Flooding algorithms are used in [[Flooding (computer networking)\|computer networking]] and [[Flood fill\|graphics]]. Flooding algorithms are also useful for solving many mathematical problems, including [[maze]] problems and many problems in [[graph theory]].

	Different flooding algorithms can be applied for different problems, and run with different [[time complexities]]. For example, the [[flood fill]] algorithm is a simple but relatively robust algorithm that works for intricate geometries and can determine which part of the (target) area that is [[Glossary of graph theory#Connectivity\|connected]] to a given (source) node in a multi-dimensional [[Array data structure\|array]], and is trivially generalized to arbitrary graph structures. If there instead are several source nodes, there are no obstructions in the geometry represented in the multi-dimensional array, and one wishes to segment the area based on which of the source nodes the target nodes are closest to, while the flood fill algorithm can still be used, the [[jump flooding algorithm]] is potentially much faster as it has a lower time complexity. Unlike the flood fill algorithm, however, the jump flooding algorithm cannot trivially be generalized to unstructured graphs.		Different flooding algorithms can be applied for different problems, and run with different [[time complexities]]. For example, the [[flood fill]] algorithm is a simple but relatively robust algorithm that works for intricate geometries and can determine which part of the (target) area that is [[Glossary of graph theory#Connectivity\|connected]] to a given (source) node in a multi-dimensional [[Array data structure\|array]], and is trivially generalized to arbitrary graph structures. If there instead are several source nodes, there are no obstructions in the geometry represented in the multi-dimensional array, and one wishes to segment the area based on which of the source nodes the target nodes are closest to, while the flood fill algorithm can still be used, the [[jump flooding algorithm]] is potentially much faster as it has a lower time complexity. Unlike the flood fill algorithm, however, the jump flooding algorithm cannot trivially be generalized to unstructured graphs.<ref>{{Cite web \|title=What is Flooding Algorithm \|url=https://www.igi-global.com/dictionary/flooding-algorithm/11267#:~:text=A%20flooding%20algorithm%20is%20an,part%20of%20some%20routing%20protocols. \|website=IGI Global}}</ref><ref>{{Cite web \|title=Flooding in Computer Networks \|url=https://byjus.com/gate/flooding-in-computer-networks-notes/ \|website=Byjus's Exam Prep}}</ref>

	== See also ==		== See also ==

Davide King: ce

2024-10-30T13:44:29Z

← Previous revision		Revision as of 13:44, 30 October 2024
Line 4:		Line 4:
	{{Unreferenced\|date=January 2024}}		{{Unreferenced\|date=January 2024}}
	}}		}}
	A '''flooding algorithm''' is an [[algorithm]] for distributing material to every part of a [[Graph (discrete mathematics)\|graph]]. The name derives from the concept of inundation by a [[flood]].		A '''flooding algorithm''' is an [[algorithm]] for distributing material to every part of a [[Graph (discrete mathematics)\|graph]]. The name derives from the concept of inundation by a [[flood]]. Flooding algorithms are used in [[Flooding (computer networking)\|computer networking]] and [[Flood fill\|graphics]]. Flooding algorithms are also useful for solving many mathematical problems, including [[maze]] problems and many problems in [[graph theory]].

	Flooding algorithms are used in [[Flooding (computer networking)\|computer networking]] and [[Flood fill\|graphics]]. Flooding algorithms are also useful for solving many mathematical problems, including [[maze]] problems and many problems in [[graph theory]].

	Different flooding algorithms can be applied for different problems, and run with different [[time complexities]]. For example, the [[flood fill]] algorithm is a simple but relatively robust algorithm that works for intricate geometries and can determine which part of the (target) area that is [[Glossary of graph theory#Connectivity\|connected]] to a given (source) node in a multi-dimensional [[Array data structure\|array]], and is trivially generalized to arbitrary graph structures. If there instead are several source nodes, there are no obstructions in the geometry represented in the multi-dimensional array, and one wishes to segment the area based on which of the source nodes the target nodes are closest to, while the flood fill algorithm can still be used, the [[jump flooding algorithm]] is potentially much faster as it has a lower time complexity. Unlike the flood fill algorithm, however, the jump flooding algorithm cannot trivially be generalized to unstructured graphs.		Different flooding algorithms can be applied for different problems, and run with different [[time complexities]]. For example, the [[flood fill]] algorithm is a simple but relatively robust algorithm that works for intricate geometries and can determine which part of the (target) area that is [[Glossary of graph theory#Connectivity\|connected]] to a given (source) node in a multi-dimensional [[Array data structure\|array]], and is trivially generalized to arbitrary graph structures. If there instead are several source nodes, there are no obstructions in the geometry represented in the multi-dimensional array, and one wishes to segment the area based on which of the source nodes the target nodes are closest to, while the flood fill algorithm can still be used, the [[jump flooding algorithm]] is potentially much faster as it has a lower time complexity. Unlike the flood fill algorithm, however, the jump flooding algorithm cannot trivially be generalized to unstructured graphs.

AmitabhCS: Added link to the wiki page on Amnesiac Flooding.

2024-04-21T22:27:50Z

Added link to the wiki page on Amnesiac Flooding.

← Previous revision		Revision as of 22:27, 21 April 2024
Line 17:		Line 17:
	* [[Spanning tree]]		* [[Spanning tree]]
	* [[Spanning Tree Protocol]]		* [[Spanning Tree Protocol]]
			* [[Amnesiac flooding\|Amnesiac Flooding]]

	== References ==		== References ==

CactiStaccingCrane: Add {{reflist}} (via WP:JWB)

2024-01-20T07:46:01Z

Add {{reflist}} (via WP:JWB)

← Previous revision		Revision as of 07:46, 20 January 2024
Line 17:		Line 17:
	* [[Spanning tree]]		* [[Spanning tree]]
	* [[Spanning Tree Protocol]]		* [[Spanning Tree Protocol]]

			== References ==
			{{reflist}}

	== External links ==		== External links ==
	* [https://arxiv.org/abs/1305.5756 Flooding edge or node weighted graphs, Fernand Meyer]		* [https://arxiv.org/abs/1305.5756 Flooding edge or node weighted graphs, Fernand Meyer]
	* [https://web.archive.org/web/20131211173036/http://users.eastlink.ca/~sharrywhite/Download.html Water Retention Utility]		* [https://web.archive.org/web/20131211173036/http://users.eastlink.ca/~sharrywhite/Download.html Water Retention Utility]



	[[Category:Flooding algorithms\| ]]		[[Category:Flooding algorithms\| ]]

Theroadislong: Added {{Notability}} and {{Unreferenced}} tags

2024-01-18T17:18:08Z

Added {{Notability}} and {{Unreferenced}} tags

← Previous revision		Revision as of 17:18, 18 January 2024
Line 1:		Line 1:
	{{Short description\|Class of algorithms}}		{{Short description\|Class of algorithms}}
			{{Multiple issues\|
			{{Notability\|date=January 2024}}
			{{Unreferenced\|date=January 2024}}
			}}
	A '''flooding algorithm''' is an [[algorithm]] for distributing material to every part of a [[Graph (discrete mathematics)\|graph]]. The name derives from the concept of inundation by a [[flood]].		A '''flooding algorithm''' is an [[algorithm]] for distributing material to every part of a [[Graph (discrete mathematics)\|graph]]. The name derives from the concept of inundation by a [[flood]].

Zulu Mike Yankee: /* See also */

2023-01-29T00:31:37Z

Kri: Mentioned the flood fill algorithm and the jump flooding algorithm and their relative strengths and weaknesses

2022-01-16T19:21:03Z

Mentioned the flood fill algorithm and the jump flooding algorithm and their relative strengths and weaknesses

← Previous revision		Revision as of 19:21, 16 January 2022
Line 3:		Line 3:

	Flooding algorithms are used in [[Flooding (computer networking)\|computer networking]] and [[Flood fill\|graphics]]. Flooding algorithms are also useful for solving many mathematical problems, including [[maze]] problems and many problems in [[graph theory]].		Flooding algorithms are used in [[Flooding (computer networking)\|computer networking]] and [[Flood fill\|graphics]]. Flooding algorithms are also useful for solving many mathematical problems, including [[maze]] problems and many problems in [[graph theory]].

			Different flooding algorithms can be applied for different problems, and run with different [[time complexities]]. For example, the [[flood fill]] algorithm is a simple but relatively robust algorithm that works for intricate geometries and can determine which part of the (target) area that is [[Glossary of graph theory#Connectivity\|connected]] to a given (source) node in a multi-dimensional [[Array data structure\|array]], and is trivially generalized to arbitrary graph structures. If there instead are several source nodes, there are no obstructions in the geometry represented in the multi-dimensional array, and one wishes to segment the area based on which of the source nodes the target nodes are closest to, while the flood fill algorithm can still be used, the [[jump flooding algorithm]] is potentially much faster as it has a lower time complexity. Unlike the flood fill algorithm, however, the jump flooding algorithm cannot trivially be generalized to unstructured graphs.

	== See also ==		== See also ==

Kri: Updated categories

2022-01-16T18:26:46Z

Updated categories

← Previous revision		Revision as of 18:26, 16 January 2022
Line 17:		Line 17:


	[[Category:Flooding algorithms\|~~Flooding~~ ~~algorithms~~]]		[[Category:Flooding algorithms\| ]]

Kri: Updated categories

2022-01-16T18:26:31Z

Updated categories

← Previous revision		Revision as of 18:26, 16 January 2022
Line 17:		Line 17:


	[[Category:Flooding algorithms]]		[[Category:Flooding algorithms\|Flooding algorithms]]

Kri: Updated categories

2022-01-16T18:25:08Z

Updated categories

← Previous revision		Revision as of 18:25, 16 January 2022
Line 17:		Line 17:


	[[Category:~~Graph~~ algorithms]]		[[Category:Flooding algorithms]]
	[[Category:Routing algorithms]]

← Previous revision		Revision as of 18:11, 26 January 2025
Line 1:		Line 1:
	{{Short description\|Class of algorithms}}		{{Short description\|Class of algorithms}}
	{{Multiple issues\|		{{Multiple issues\|{{Notability\|date=January 2024}}}}
	{{Notability\|date=January 2024}}
	{{Unreferenced\|date=January 2024}}
	}}
	A '''flooding algorithm''' is an [[algorithm]] for distributing material to every part of a [[Graph (discrete mathematics)\|graph]]. The name derives from the concept of inundation by a [[flood]]. Flooding algorithms are used in [[Flooding (computer networking)\|computer networking]] and [[Flood fill\|graphics]]. Flooding algorithms are also useful for solving many mathematical problems, including [[maze]] problems and many problems in [[graph theory]].		A '''flooding algorithm''' is an [[algorithm]] for distributing material to every part of a [[Graph (discrete mathematics)\|graph]]. The name derives from the concept of inundation by a [[flood]]. Flooding algorithms are used in [[Flooding (computer networking)\|computer networking]] and [[Flood fill\|graphics]]. Flooding algorithms are also useful for solving many mathematical problems, including [[maze]] problems and many problems in [[graph theory]].

	Different flooding algorithms can be applied for different problems, and run with different [[time complexities]]. For example, the [[flood fill]] algorithm is a simple but relatively robust algorithm that works for intricate geometries and can determine which part of the (target) area that is [[Glossary of graph theory#Connectivity\|connected]] to a given (source) node in a multi-dimensional [[Array data structure\|array]], and is trivially generalized to arbitrary graph structures. If there instead are several source nodes, there are no obstructions in the geometry represented in the multi-dimensional array, and one wishes to segment the area based on which of the source nodes the target nodes are closest to, while the flood fill algorithm can still be used, the [[jump flooding algorithm]] is potentially much faster as it has a lower time complexity. Unlike the flood fill algorithm, however, the jump flooding algorithm cannot trivially be generalized to unstructured graphs.		Different flooding algorithms can be applied for different problems, and run with different [[time complexities]]. For example, the [[flood fill]] algorithm is a simple but relatively robust algorithm that works for intricate geometries and can determine which part of the (target) area that is [[Glossary of graph theory#Connectivity\|connected]] to a given (source) node in a multi-dimensional [[Array data structure\|array]], and is trivially generalized to arbitrary graph structures. If there instead are several source nodes, there are no obstructions in the geometry represented in the multi-dimensional array, and one wishes to segment the area based on which of the source nodes the target nodes are closest to, while the flood fill algorithm can still be used, the [[jump flooding algorithm]] is potentially much faster as it has a lower time complexity. Unlike the flood fill algorithm, however, the jump flooding algorithm cannot trivially be generalized to unstructured graphs.<ref>{{Cite web \|title=What is Flooding Algorithm \|url=https://www.igi-global.com/dictionary/flooding-algorithm/11267#:~:text=A%20flooding%20algorithm%20is%20an,part%20of%20some%20routing%20protocols. \|website=IGI Global}}</ref><ref>{{Cite web \|title=Flooding in Computer Networks \|url=https://byjus.com/gate/flooding-in-computer-networks-notes/ \|website=Byjus's Exam Prep}}</ref>

	== See also ==		== See also ==

← Previous revision		Revision as of 13:44, 30 October 2024
Line 4:		Line 4:
	{{Unreferenced\|date=January 2024}}		{{Unreferenced\|date=January 2024}}
	}}		}}
	A '''flooding algorithm''' is an [[algorithm]] for distributing material to every part of a [[Graph (discrete mathematics)\|graph]]. The name derives from the concept of inundation by a [[flood]].		A '''flooding algorithm''' is an [[algorithm]] for distributing material to every part of a [[Graph (discrete mathematics)\|graph]]. The name derives from the concept of inundation by a [[flood]]. Flooding algorithms are used in [[Flooding (computer networking)\|computer networking]] and [[Flood fill\|graphics]]. Flooding algorithms are also useful for solving many mathematical problems, including [[maze]] problems and many problems in [[graph theory]].

	Flooding algorithms are used in [[Flooding (computer networking)\|computer networking]] and [[Flood fill\|graphics]]. Flooding algorithms are also useful for solving many mathematical problems, including [[maze]] problems and many problems in [[graph theory]].

	Different flooding algorithms can be applied for different problems, and run with different [[time complexities]]. For example, the [[flood fill]] algorithm is a simple but relatively robust algorithm that works for intricate geometries and can determine which part of the (target) area that is [[Glossary of graph theory#Connectivity\|connected]] to a given (source) node in a multi-dimensional [[Array data structure\|array]], and is trivially generalized to arbitrary graph structures. If there instead are several source nodes, there are no obstructions in the geometry represented in the multi-dimensional array, and one wishes to segment the area based on which of the source nodes the target nodes are closest to, while the flood fill algorithm can still be used, the [[jump flooding algorithm]] is potentially much faster as it has a lower time complexity. Unlike the flood fill algorithm, however, the jump flooding algorithm cannot trivially be generalized to unstructured graphs.		Different flooding algorithms can be applied for different problems, and run with different [[time complexities]]. For example, the [[flood fill]] algorithm is a simple but relatively robust algorithm that works for intricate geometries and can determine which part of the (target) area that is [[Glossary of graph theory#Connectivity\|connected]] to a given (source) node in a multi-dimensional [[Array data structure\|array]], and is trivially generalized to arbitrary graph structures. If there instead are several source nodes, there are no obstructions in the geometry represented in the multi-dimensional array, and one wishes to segment the area based on which of the source nodes the target nodes are closest to, while the flood fill algorithm can still be used, the [[jump flooding algorithm]] is potentially much faster as it has a lower time complexity. Unlike the flood fill algorithm, however, the jump flooding algorithm cannot trivially be generalized to unstructured graphs.

← Previous revision		Revision as of 17:18, 18 January 2024
Line 1:		Line 1:
	{{Short description\|Class of algorithms}}		{{Short description\|Class of algorithms}}
			{{Multiple issues\|
			{{Notability\|date=January 2024}}
			{{Unreferenced\|date=January 2024}}
			}}
	A '''flooding algorithm''' is an [[algorithm]] for distributing material to every part of a [[Graph (discrete mathematics)\|graph]]. The name derives from the concept of inundation by a [[flood]].		A '''flooding algorithm''' is an [[algorithm]] for distributing material to every part of a [[Graph (discrete mathematics)\|graph]]. The name derives from the concept of inundation by a [[flood]].

← Previous revision		Revision as of 00:31, 29 January 2023
Line 10:		Line 10:
	* [[Water retention on mathematical surfaces]]		* [[Water retention on mathematical surfaces]]
	* [[Flood fill]]		* [[Flood fill]]
			* [[Graph traversal]]
	* [[Spanning tree]]		* [[Spanning tree]]
	* [[Spanning Tree Protocol]]		* [[Spanning Tree Protocol]]