<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[RSS Feed]]></title><description><![CDATA[RSS Feed]]></description><link>http://direct.ecency.com</link><image><url>http://direct.ecency.com/logo512.png</url><title>RSS Feed</title><link>http://direct.ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Tue, 14 Apr 2026 06:45:02 GMT</lastBuildDate><atom:link href="http://direct.ecency.com/created/ortools/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[Soffit non-progress report #3]]></title><description><![CDATA[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]]></description><link>http://direct.ecency.com/procjam/@markgritter/soffit-non-progress-report-3</link><guid isPermaLink="true">http://direct.ecency.com/procjam/@markgritter/soffit-non-progress-report-3</guid><category><![CDATA[procjam]]></category><dc:creator><![CDATA[markgritter]]></dc:creator><pubDate>Tue, 30 Oct 2018 05:45:12 GMT</pubDate></item><item><title><![CDATA[Soffit progress report #2]]></title><description><![CDATA[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]]></description><link>http://direct.ecency.com/programming/@markgritter/soffit-progress-report-2</link><guid isPermaLink="true">http://direct.ecency.com/programming/@markgritter/soffit-progress-report-2</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[markgritter]]></dc:creator><pubDate>Mon, 29 Oct 2018 04:18:27 GMT</pubDate></item><item><title><![CDATA[Finding subgraphs with constraint programming and Google OR-tools]]></title><description><![CDATA[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]]></description><link>http://direct.ecency.com/programming/@markgritter/finding-subgraphs-with-constraint-programming-and-google-or-tools</link><guid isPermaLink="true">http://direct.ecency.com/programming/@markgritter/finding-subgraphs-with-constraint-programming-and-google-or-tools</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[markgritter]]></dc:creator><pubDate>Thu, 18 Oct 2018 07:57:09 GMT</pubDate><enclosure url="https://images.ecency.com/p/C3TZR1g81UNaPs7vzNXHueW5ZM76DSHWEY7onmfLxcK2iQHU6nGoemHaDwaucq7unNrb2vGdA3deBhMFNJEaTe6JwvcbetPox8HG7BdF9JAmKcGCULSg8H4?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>