David Baer @david@arktos.social

The other way to do it would be to forget about the edge weights and just build the spanning tree by selecting a random edge from an already-connected block. But then I wouldn't have had to remember all that stuff about priority queues and heaps, and where's the fun in that?

The spanning tree guarantees that there are no cycles, every square is accessible, and there is exactly one path from the start at the lower left to the end at the upper right.

Treat an array of blocks as nodes in a graph, with the blocks above, below, to the right and left of each block as adjacent, and assign random edge weights. Then run Prim's minimum spanning tree algorithm. Voila! A block maze!

My youngest is... sort of impressed.

Homemade pepperoni pizza for tonight’s family dinner.

Half-hour work break to get my ass kicked on the treadmill. Now back to work...

Just now discovering the adverbial use of "lowkey" through my kids’ favorite YouTubers. I feel very old.

https://www.urbandictionary.com/define.php?term=Lowkey

Apparently my 10×great grandfather was a delegate to the Synod of Dort. Cool!

https://en.wikipedia.org/wiki/Herman_op_den_Graeff

Read the whole recipe next time!

“You shall eat it as a barley-cake, baking it in their sight on human dung.” -Ezekiel 4:12

People think they’re all clever, making a recipe from the Bible... 1/2

Glorious evening in our neighborhood!

Why hello, spring flowers!

Sigh... This is wrong:

multipart/alternative
|->text/plain
|->mulitipart/mixed
|->text/html
|->(attachment)

This is right:

multipart/mixed
|->multipart/alternative
| |->text/plain
| |->text/html
|->(attachment)

The local school board is floating a proposal to go full time in person for the final 7 weeks of school, instead of the current hybrid schedule. A lot of kids would have to change teachers. Seems like a lot of disruption for such a short time. Save the plan for September!