I finally figured out (I think) how to encode the "dangling condition" for graph rewriting into or-tools, but then it started crashing on me with some regularity. I created a pull request: to

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

Here's a graph: Suppose you want to find all subgraphs that look like this: (That is, two adjacent edges.) One way to implement such a search is to use Constraint Programming, and Google has a library