<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>oue&#039;s profile &#187; dijkstra</title>
	<atom:link href="http://www.aspgod.com/tag/dijkstra/feed" rel="self" type="application/rss+xml" />
	<link>http://www.aspgod.com</link>
	<description>AI algorithm graphics programming blog Firefox ff</description>
	<lastBuildDate>Fri, 20 Jan 2012 16:59:45 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1.2</generator>
		<item>
		<title>Dijkstra&#8217;s Algorithm</title>
		<link>http://www.aspgod.com/project/ai/dijkstra-algorithm.html</link>
		<comments>http://www.aspgod.com/project/ai/dijkstra-algorithm.html#comments</comments>
		<pubDate>Fri, 24 Apr 2009 19:10:22 +0000</pubDate>
		<dc:creator>aspgod</dc:creator>
				<category><![CDATA[AI]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[dijkstra]]></category>

		<guid isPermaLink="false">http://www.aspgod.com/myprofile/?p=19</guid>
		<description><![CDATA[This project show the shortest path to the target. How to : The input parameter is 1. Uwajima 2. Matsuyama 3. Nakamura 4. Kochi 5. Kawanoe 6. Ikeda 7. Takamatsu 8. Tokushima 9. Muroto Enter the start and end to get the answer. Tools &#38; Knowledge : 1. C++ 2. dijkstra algorithm Reqirement : 1. [...]
No related posts.

Related posts brought to you by <a href='http://yarpp.org'>Yet Another Related Posts Plugin</a>.]]></description>
			<content:encoded><![CDATA[<p>This project show the shortest path to the target.</p>
<p><img src="http://www.aspgod.com/file/images/dijkstramap.png" alt="Dijkstra's Map" /><span id="more-19"></span></p>
<p><strong>How to :</strong><br />
The input parameter is<br />
1. Uwajima<br />
2. Matsuyama<br />
3. Nakamura<br />
4. Kochi<br />
5. Kawanoe<br />
6. Ikeda<br />
7. Takamatsu<br />
8. Tokushima<br />
9. Muroto<br />
Enter the start and end to get the answer.</p>
<p><strong>Tools &amp; Knowledge :</strong><br />
1. C++<br />
2. dijkstra algorithm</p>
<p><strong>Reqirement : </strong><br />
1. <a href="http://www.microsoft.com/downloads/details.aspx?FamilyID=0856EACB-4362-4B0D-8EDD-AAB15C5E04F5&amp;displaylang=en" target="_blank">Microsoft .Net Framework 2.0</a> (22.4 MB)<br />
2. windows</p>
<p><strong>Download :</strong><br />
1. <a href="http://www.aspgod.com/file/dijkstra.rar">Dijkstra&#8217;s algorithm (exe)</a><br />
2. <a href="http://www.aspgod.com/myprofile/wp-content/uploads/2009/09/Dijkstra.rar">Dijkstra&#8217;s algorithm (source code)</a></p>
<p>No related posts.</p>
<p>Related posts brought to you by <a href='http://yarpp.org'>Yet Another Related Posts Plugin</a>.</p>]]></content:encoded>
			<wfw:commentRss>http://www.aspgod.com/project/ai/dijkstra-algorithm.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

