<?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: Dijkstra&#8217;s Algorithm &#8211; Shortest Path</title>
	<atom:link href="http://vasir.net/blog/gamedesgin/dijkstras_algorithm_shortest_path/feed/" rel="self" type="application/rss+xml" />
	<link>http://vasir.net/blog/gamedesgin/dijkstras_algorithm_shortest_path/</link>
	<description>Erik Hazzard&#039;s various thoughts and ramblings</description>
	<lastBuildDate>Wed, 01 Sep 2010 02:25:57 -0500</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.1</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Harshit</title>
		<link>http://vasir.net/blog/gamedesgin/dijkstras_algorithm_shortest_path/comment-page-1/#comment-5094</link>
		<dc:creator>Harshit</dc:creator>
		<pubDate>Wed, 21 Jul 2010 07:08:53 +0000</pubDate>
		<guid isPermaLink="false">http://vasir.net/blog/?p=122#comment-5094</guid>
		<description>Very nicely done and explained..
Can i get the Java Implementation of same.. will be very useful..</description>
		<content:encoded><![CDATA[<p>Very nicely done and explained..<br />
Can i get the Java Implementation of same.. will be very useful..</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Gilberto Ramos</title>
		<link>http://vasir.net/blog/gamedesgin/dijkstras_algorithm_shortest_path/comment-page-1/#comment-4157</link>
		<dc:creator>Gilberto Ramos</dc:creator>
		<pubDate>Fri, 11 Jun 2010 13:54:35 +0000</pubDate>
		<guid isPermaLink="false">http://vasir.net/blog/?p=122#comment-4157</guid>
		<description>saly: you have the c++ implementation here... http://es.wikipedia.org/wiki/Algoritmo_de_Dijkstra</description>
		<content:encoded><![CDATA[<p>saly: you have the c++ implementation here&#8230; <a href="http://es.wikipedia.org/wiki/Algoritmo_de_Dijkstra" rel="nofollow">http://es.wikipedia.org/wiki/Algoritmo_de_Dijkstra</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: saly</title>
		<link>http://vasir.net/blog/gamedesgin/dijkstras_algorithm_shortest_path/comment-page-1/#comment-3522</link>
		<dc:creator>saly</dc:creator>
		<pubDate>Sun, 16 May 2010 17:43:42 +0000</pubDate>
		<guid isPermaLink="false">http://vasir.net/blog/?p=122#comment-3522</guid>
		<description>thank you

please I need implementation of dijkestra algorithm in c++ or  java

input :
  number of router.
 LSP for each router ( ID for each nodes + coast between it and other nodes + sequence number)

output 
table for each nodes (shortest path between it and other nodes)</description>
		<content:encoded><![CDATA[<p>thank you</p>
<p>please I need implementation of dijkestra algorithm in c++ or  java</p>
<p>input :<br />
  number of router.<br />
 LSP for each router ( ID for each nodes + coast between it and other nodes + sequence number)</p>
<p>output<br />
table for each nodes (shortest path between it and other nodes)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: David E</title>
		<link>http://vasir.net/blog/gamedesgin/dijkstras_algorithm_shortest_path/comment-page-1/#comment-2668</link>
		<dc:creator>David E</dc:creator>
		<pubDate>Tue, 30 Mar 2010 20:34:49 +0000</pubDate>
		<guid isPermaLink="false">http://vasir.net/blog/?p=122#comment-2668</guid>
		<description>hey! thanks so much this was very helpful!
The arrows were a little confusing at first, but I got the hang of it!
keep posting!
~daweed~</description>
		<content:encoded><![CDATA[<p>hey! thanks so much this was very helpful!<br />
The arrows were a little confusing at first, but I got the hang of it!<br />
keep posting!<br />
~daweed~</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Andy</title>
		<link>http://vasir.net/blog/gamedesgin/dijkstras_algorithm_shortest_path/comment-page-1/#comment-1995</link>
		<dc:creator>Andy</dc:creator>
		<pubDate>Wed, 24 Feb 2010 11:18:57 +0000</pubDate>
		<guid isPermaLink="false">http://vasir.net/blog/?p=122#comment-1995</guid>
		<description>Hi,
very nice article od Dijkstra, maybe you should also take a look at Kruskal&#039;s and Prim&#039;s algorithm who are very useful too.

Have a nice one,
Andy</description>
		<content:encoded><![CDATA[<p>Hi,<br />
very nice article od Dijkstra, maybe you should also take a look at Kruskal&#8217;s and Prim&#8217;s algorithm who are very useful too.</p>
<p>Have a nice one,<br />
Andy</p>
]]></content:encoded>
	</item>
</channel>
</rss>
