Graph algorithms are fun

I have recently rediscovered (yet again) the joys of coding graph algorithms.

It's been a few years since the last time I worked on some of them: for example, I "reinvented" DFS (depth-first-search - I didn't really know about this concept at the time) as part of an implementation of a graph representing a set of possible chord progressions with weights/probabilities that a node should be randomly visited, to be used in a automated music generator.

Consider the nodes
Walk along spanning arcs
Lost in traversal

Maybe one day, I'll release that library of them that I've been building up. Then again, it means someone else might not have this fun themselves.

And day by day the monster grew,
byte by bite,
y wiser too.

IMO, graphs are one of the most versatile (and useful) data structures out there. Since practically every other interesting data structure is practically a sub-case of graphs, they're my favourite data structure.

Hola!

Here I'll be posting about various topical issues, and also about my current projects in development. In particular: - Blender - dbcskit - Project Hosting on Google Code - physlabtools - Project Hosting on Google Code There may also be the occasional music snippets and rants...