<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: data structures</title>
	<atom:link href="http://imprompt.us/2007/data-structures/feed/" rel="self" type="application/rss+xml" />
	<link>http://imprompt.us/2007/data-structures/</link>
	<description>Computer Science and Teaching and Other Ancillary Things</description>
	<lastBuildDate>Sun, 01 Aug 2010 09:52:12 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
	<item>
		<title>By: Peter</title>
		<link>http://imprompt.us/2007/data-structures/comment-page-1/#comment-16703</link>
		<dc:creator>Peter</dc:creator>
		<pubDate>Sat, 03 Oct 2009 04:42:40 +0000</pubDate>
		<guid isPermaLink="false">http://imprompt.us/2007/data-structures/#comment-16703</guid>
		<description>&lt;p&gt;This does get trickier if the data structure is not connected as a planar graph, but the low-hanging fruit is sufficient to illustrate every data structure we teach to undergraduates&lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>This does get trickier if the data structure is not connected as a planar graph, but the low-hanging fruit is sufficient to illustrate every data structure we teach to undergraduates</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Peter</title>
		<link>http://imprompt.us/2007/data-structures/comment-page-1/#comment-53</link>
		<dc:creator>Peter</dc:creator>
		<pubDate>Tue, 30 Nov 1999 00:00:00 +0000</pubDate>
		<guid isPermaLink="false">http://imprompt.us/2007/data-structures/#comment-53</guid>
		<description>&lt;p&gt;This does get trickier if the data structure is not connected as a planar graph, but the low-hanging fruit is sufficient to illustrate every data structure we teach to undergraduates&lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>This does get trickier if the data structure is not connected as a planar graph, but the low-hanging fruit is sufficient to illustrate every data structure we teach to undergraduates</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: agthorr</title>
		<link>http://imprompt.us/2007/data-structures/comment-page-1/#comment-51</link>
		<dc:creator>agthorr</dc:creator>
		<pubDate>Tue, 30 Nov 1999 00:00:00 +0000</pubDate>
		<guid isPermaLink="false">http://imprompt.us/2007/data-structures/#comment-51</guid>
		<description>&lt;p&gt;Doesn&#039;t this only work if the data structure can be represented easily in two-dimensions?  If you have lots of criss-crossing edges, it&#039;s not going to be possible to show it visually in a nice way.&lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>Doesn&#8217;t this only work if the data structure can be represented easily in two-dimensions?  If you have lots of criss-crossing edges, it&#8217;s not going to be possible to show it visually in a nice way.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: m.munroe</title>
		<link>http://imprompt.us/2007/data-structures/comment-page-1/#comment-52</link>
		<dc:creator>m.munroe</dc:creator>
		<pubDate>Tue, 30 Nov 1999 00:00:00 +0000</pubDate>
		<guid isPermaLink="false">http://imprompt.us/2007/data-structures/#comment-52</guid>
		<description>&lt;p&gt;Just happened across your livejournal page and thought I&#039;d say Hi.  Fellow Mudd grad (&#039;88) with a PhD in Physics from UofO and living in Eugene.  Hope Oregon is treating you well.&lt;/p&gt;&lt;p&gt;All the best,&lt;/p&gt;&lt;p&gt;Mike Munroe&lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>Just happened across your livejournal page and thought I&#8217;d say Hi.  Fellow Mudd grad (&#8217;88) with a PhD in Physics from UofO and living in Eugene.  Hope Oregon is treating you well.</p>
<p>All the best,</p>
<p>Mike Munroe</p>
]]></content:encoded>
	</item>
</channel>
</rss>
