A K-club on a graph is a subset of the vertices such that the diameter of the induced subgraph is less than or equal to K. "Induced subgraph" just means "pick all the edges which both endpoints

Let's create a graph grammar with Soffit that generates a fixed-sized binary tree. How do we tell a graph grammar when to stop working? One option is to only run it for a fixed number of iterations, but

The #1 question about graphviz seems to be "why can't I get it to lay out my clusters in the way I want", judging from the number of StackOverflow questions I see. I wrote some code in Soffit

As a follow up to Double Pushouts on Graphs I was trying to understand how things work when we add labels. This caused me some confusion, because I was wondering "which label does the edge get, when

My library finally performed a graph rewrite today! Still a ways from a "launch" version, but the core of the engine works, at least in a simple case. Repository: As of this commit I have a unit

Github repository: Previous entry: "My #Procjam Project: Soffit" I was supposed to go out and have fun this weekend; instead I both got sick and handled two customer escalations. But I made a

As usual, my #procjam project is way too ambitious for what I can actually get done in a work week, particularly one where I'm out at headquarters in California. I'm trying to build a graph grammar engine

A partir de la secuencia de las notas en un solo de guitarra se puede obtener una red de conexiones entre estas notas. Ferretti ha tenido la idea de analizar estas redes utilizando las herramientas modernas