Genuary 2021 - day 20
Computing MSTs of planar graphs for #genuary2021
Genuary is a series of prompts to inspire generated art in the month of January. You can find a list of the prompts here: https://genuary2021.github.io/prompts
You can see all of my genuary art and more by following me on twitter: https://twitter.com/ad29111
Today’s prompt was
No loops. This prompt made me think of my datastructures
and algorithms classes where I learned about spanning trees which can take a
graph that may have cycles and turn them into trees which by nature, cannot have
cycles. Today I wrote a program to generate a planar graph and find it’s MST.
It’s a bit buggy in that some of the graphs generated aren’t planar and I didn’t
write any code to enforce connectedness. It’s close enough though. Hopefully if
you’re learning about MSTs right now this is a good visual tool!