Flood fill算法是从一个区域中提取若干个连通的点与其他相邻区域区分开（或分别染成不同颜色）的经典算法。因为其思路类似洪水从一个区域扩散到所有能到达的区域而得名。在GNU Go和扫雷中，Flood Fill算法被用来计算需要被清除的区域。-Flood fill algorithm is extracted　an area several connecting points distinguish with other adjacent areas (or dyed different colors) of classic algorithms. Because the idea similar floods　a regional spread to all can reach the name. In the GNU Go and mine clearance, Flood Fill algorithm is used to calculate the area need to be cleared.