Press the green flag and watch it randomly generate 6 pairs of nodes with distinct, non-overlapping paths using the BFS algorithm. The red X turns to a green checkmark when complete.
I originally wrote this in perl, then ported it to scratch for use in a fellow scratcher's project. The slowness is based on using a "broadcast and wait" for demonstration purposes. The BFS sprite has all necessary scripts to be easily backpacked.
