<?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: Computer Algorithms: Graph Depth-First Search</title>
	<atom:link href="/2012/09/17/computer-algorithms-graph-depth-first-search/feed/" rel="self" type="application/rss+xml" />
	<link>/2012/09/17/computer-algorithms-graph-depth-first-search/</link>
	<description>on web development</description>
	<lastBuildDate>Fri, 26 Oct 2018 21:40:18 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>https://wordpress.org/?v=5.0.3</generator>
	<item>
		<title>By: John</title>
		<link>/2012/09/17/computer-algorithms-graph-depth-first-search/comment-page-1/#comment-451596</link>
		<dc:creator><![CDATA[John]]></dc:creator>
		<pubDate>Thu, 04 May 2017 00:02:02 +0000</pubDate>
		<guid isPermaLink="false">/?p=3340#comment-451596</guid>
		<description><![CDATA[Hi Stoimen,

I&#039;ll like to implement a Depth Limited Search using this code.  Where do I specify the depth in the code please?
Thanks.]]></description>
		<content:encoded><![CDATA[<p>Hi Stoimen,</p>
<p>I&#8217;ll like to implement a Depth Limited Search using this code.  Where do I specify the depth in the code please?<br />
Thanks.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Chris Russell</title>
		<link>/2012/09/17/computer-algorithms-graph-depth-first-search/comment-page-1/#comment-420942</link>
		<dc:creator><![CDATA[Chris Russell]]></dc:creator>
		<pubDate>Thu, 22 Sep 2016 02:33:27 +0000</pubDate>
		<guid isPermaLink="false">/?p=3340#comment-420942</guid>
		<description><![CDATA[Nice. If you&#039;re interested in working with in-memory directed graph models in JavaScript (Node.js and in the client browser) check out Encapsule/jsgraph package: http://www.boost.org/doc/libs/1_61_0/libs/graph/doc/table_of_contents.html]]></description>
		<content:encoded><![CDATA[<p>Nice. If you&#8217;re interested in working with in-memory directed graph models in JavaScript (Node.js and in the client browser) check out Encapsule/jsgraph package: <a href="http://www.boost.org/doc/libs/1_61_0/libs/graph/doc/table_of_contents.html" rel="nofollow">http://www.boost.org/doc/libs/1_61_0/libs/graph/doc/table_of_contents.html</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: greenpea</title>
		<link>/2012/09/17/computer-algorithms-graph-depth-first-search/comment-page-1/#comment-21739</link>
		<dc:creator><![CDATA[greenpea]]></dc:creator>
		<pubDate>Tue, 01 Apr 2014 22:02:26 +0000</pubDate>
		<guid isPermaLink="false">/?p=3340#comment-21739</guid>
		<description><![CDATA[How about using a stack instead of recursion?]]></description>
		<content:encoded><![CDATA[<p>How about using a stack instead of recursion?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: pat=yal</title>
		<link>/2012/09/17/computer-algorithms-graph-depth-first-search/comment-page-1/#comment-18663</link>
		<dc:creator><![CDATA[pat=yal]]></dc:creator>
		<pubDate>Mon, 06 May 2013 03:34:35 +0000</pubDate>
		<guid isPermaLink="false">/?p=3340#comment-18663</guid>
		<description><![CDATA[thank u ...........=) got a clear idea...............]]></description>
		<content:encoded><![CDATA[<p>thank u &#8230;&#8230;&#8230;..=) got a clear idea&#8230;&#8230;&#8230;&#8230;&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Stoimen</title>
		<link>/2012/09/17/computer-algorithms-graph-depth-first-search/comment-page-1/#comment-16637</link>
		<dc:creator><![CDATA[Stoimen]]></dc:creator>
		<pubDate>Tue, 25 Sep 2012 13:39:57 +0000</pubDate>
		<guid isPermaLink="false">/?p=3340#comment-16637</guid>
		<description><![CDATA[@Tomáš - thanks for the note! You&#039;re absolutely right, this should be fixed!]]></description>
		<content:encoded><![CDATA[<p>@Tomáš &#8211; thanks for the note! You&#8217;re absolutely right, this should be fixed!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tomáš Záluský</title>
		<link>/2012/09/17/computer-algorithms-graph-depth-first-search/comment-page-1/#comment-16636</link>
		<dc:creator><![CDATA[Tomáš Záluský]]></dc:creator>
		<pubDate>Tue, 25 Sep 2012 13:23:15 +0000</pubDate>
		<guid isPermaLink="false">/?p=3340#comment-16636</guid>
		<description><![CDATA[Nice article.
Small nit to image /wp-content/uploads/2012/09/2.-DFS-explained.png: shouldn&#039;t the yellow node at 2nd row rather be of Level 7? The yellow area is entered from 3rd node in 4th row (deepest darkblue node) and there is one backtrack in it.]]></description>
		<content:encoded><![CDATA[<p>Nice article.<br />
Small nit to image <a href="/wp-content/uploads/2012/09/2.-DFS-explained.png" rel="nofollow">/wp-content/uploads/2012/09/2.-DFS-explained.png</a>: shouldn&#8217;t the yellow node at 2nd row rather be of Level 7? The yellow area is entered from 3rd node in 4th row (deepest darkblue node) and there is one backtrack in it.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
