Well, making a similar graph while adding in uranium is an interesting problem. If you're looking to make it "pretty", that could be very difficult. We're pretty much talking about arranging twenty one nodes containing ten cycles such that there is minimal intersection between the cycles. I can't think of a proof off the top of my head, but that sounds NP-Hard. And doing exponential complexity number crunching on a 21-node graph ain't a cakewalk
