forked from TheAlgorithms/C-Sharp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
FloodFill.cs
97 lines (85 loc) · 4.13 KB
/
FloodFill.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
using System;
using System.Collections.Generic;
using System.Drawing;
namespace Algorithms.Other;
/// <summary>
/// Flood fill, also called seed fill, is an algorithm that determines and
/// alters the area connected to a given node in a multi-dimensional array with
/// some matching attribute. It is used in the "bucket" fill tool of paint
/// programs to fill connected, similarly-colored areas with a different color.
/// (description adapted from https://en.wikipedia.org/wiki/Flood_fill)
/// (see also: https://www.techiedelight.com/flood-fill-algorithm/).
/// </summary>
public static class FloodFill
{
private static readonly List<(int xOffset, int yOffset)> Neighbors = new() { (-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 0), (1, 1) };
/// <summary>
/// Implements the flood fill algorithm through a breadth-first approach using a queue.
/// </summary>
/// <param name="bitmap">The bitmap to which the algorithm is applied.</param>
/// <param name="location">The start location on the bitmap.</param>
/// <param name="targetColor">The old color to be replaced.</param>
/// <param name="replacementColor">The new color to replace the old one.</param>
public static void BreadthFirstSearch(Bitmap bitmap, (int x, int y) location, Color targetColor, Color replacementColor)
{
if (location.x < 0 || location.x >= bitmap.Width || location.y < 0 || location.y >= bitmap.Height)
{
throw new ArgumentOutOfRangeException(nameof(location), $"{nameof(location)} should point to a pixel within the bitmap");
}
var queue = new List<(int x, int y)>();
queue.Add(location);
while (queue.Count > 0)
{
BreadthFirstFill(bitmap, location, targetColor, replacementColor, queue);
}
}
/// <summary>
/// Implements the flood fill algorithm through a depth-first approach through recursion.
/// </summary>
/// <param name="bitmap">The bitmap to which the algorithm is applied.</param>
/// <param name="location">The start location on the bitmap.</param>
/// <param name="targetColor">The old color to be replaced.</param>
/// <param name="replacementColor">The new color to replace the old one.</param>
public static void DepthFirstSearch(Bitmap bitmap, (int x, int y) location, Color targetColor, Color replacementColor)
{
if (location.x < 0 || location.x >= bitmap.Width || location.y < 0 || location.y >= bitmap.Height)
{
throw new ArgumentOutOfRangeException(nameof(location), $"{nameof(location)} should point to a pixel within the bitmap");
}
DepthFirstFill(bitmap, location, targetColor, replacementColor);
}
private static void BreadthFirstFill(Bitmap bitmap, (int x, int y) location, Color targetColor, Color replacementColor, List<(int x, int y)> queue)
{
(int x, int y) currentLocation = queue[0];
queue.RemoveAt(0);
if (bitmap.GetPixel(currentLocation.x, currentLocation.y) == targetColor)
{
bitmap.SetPixel(currentLocation.x, currentLocation.y, replacementColor);
for (int i = 0; i < Neighbors.Count; i++)
{
int x = currentLocation.x + Neighbors[i].xOffset;
int y = currentLocation.y + Neighbors[i].yOffset;
if (x >= 0 && x < bitmap.Width && y >= 0 && y < bitmap.Height)
{
queue.Add((x, y));
}
}
}
}
private static void DepthFirstFill(Bitmap bitmap, (int x, int y) location, Color targetColor, Color replacementColor)
{
if (bitmap.GetPixel(location.x, location.y) == targetColor)
{
bitmap.SetPixel(location.x, location.y, replacementColor);
for (int i = 0; i < Neighbors.Count; i++)
{
int x = location.x + Neighbors[i].xOffset;
int y = location.y + Neighbors[i].yOffset;
if (x >= 0 && x < bitmap.Width && y >= 0 && y < bitmap.Height)
{
DepthFirstFill(bitmap, (x, y), targetColor, replacementColor);
}
}
}
}
}