Color Flood II
First, Wilson’s algorithm generates a uniform spanning tree of the 960×500 canvas. (This is a computationally-expensive process and is run in a background worker.) Then, a breadth-first traversal of the spanning tree floods the canvas with color. Compare this to Prim’s algorithm.