The doubly connected edge list was a fun foray into data structures in over the weekend. The reference I used was [1], although now I see that Wikipedia also has a reasonable intro [2].

This structure is useful for representing planar graphs, which are an important building block if you want to generate maps of imaginary worlds.


Sign in to participate in the conversation
Mastodon @ SDF

"I appreciate SDF but it's a general-purpose server and the name doesn't make it obvious that it's about art." - Eugen Rochko