In this release, the breadth-first filling of an undirected graph of neighboring pixels was implemented. The graph is determined by the size of the filling window size and is independent of pixel values. This lets us memoize some calculations. In a compartment with the use of bitmasks wherever possible, this made it possible to speed up execution by 5-6 times.