<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="../assets/xml/rss.xsl" media="all"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Asymptotic Labs (Posts about graph theory)</title><link>http://asymptoticlabs.com/</link><description></description><atom:link href="http://asymptoticlabs.com/categories/graph-theory.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2022 &lt;a href="mailto:quidditymaster@gmail.com"&gt;Tim Anderton&lt;/a&gt; </copyright><lastBuildDate>Wed, 31 Aug 2022 21:28:47 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Loopy Locks and Graphs</title><link>http://asymptoticlabs.com/posts/loopy-locks-and-graphs.html</link><dc:creator>Tim Anderton</dc:creator><description>&lt;div class="cell border-box-sizing text_cell rendered"&gt;&lt;div class="prompt input_prompt"&gt;
&lt;/div&gt;&lt;div class="inner_cell"&gt;
&lt;div class="text_cell_render border-box-sizing rendered_html"&gt;
&lt;p&gt;A friend of mine introduced me to a long running series of puzzles called "the riddler" that are put out by 538 once a week. The harder "riddler classic" this week was interesting enough that I decided to give it a try. The code I wrote while messing around with the riddle was interesting enough that I thought I would share.&lt;/p&gt;
&lt;p&gt;&lt;a href="http://asymptoticlabs.com/posts/loopy-locks-and-graphs.html"&gt;Read more…&lt;/a&gt; (13 min remaining to read)&lt;/p&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/body&gt;&lt;/html&gt;
</description><category>graph theory</category><category>riddler</category><guid>http://asymptoticlabs.com/posts/loopy-locks-and-graphs.html</guid><pubDate>Tue, 03 Jul 2018 19:37:35 GMT</pubDate></item></channel></rss>