<?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>nocture.dk &#187; Code</title>
	<atom:link href="http://nocture.dk/archives/category/code/feed" rel="self" type="application/rss+xml" />
	<link>http://nocture.dk</link>
	<description>Traveling through hyperspace ain&#039;t like dusting crops, boy! Without precise calculations we could fly right through a star, or bounce too close to a supernova and that&#039;d end your trip real quick, wouldn&#039;t it?</description>
	<lastBuildDate>Tue, 12 Jul 2011 05:18:46 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
		<item>
		<title>NetMeter tool released</title>
		<link>http://nocture.dk/archives/116</link>
		<comments>http://nocture.dk/archives/116#comments</comments>
		<pubDate>Wed, 13 Jan 2010 17:37:04 +0000</pubDate>
		<dc:creator>Jeppe Andersen</dc:creator>
				<category><![CDATA[Code]]></category>
		<category><![CDATA[.NET]]></category>
		<category><![CDATA[Application]]></category>
		<category><![CDATA[C#]]></category>
		<category><![CDATA[Network]]></category>

		<guid isPermaLink="false">http://nocture.dk/?p=116</guid>
		<description><![CDATA[I have always been using a small tool to monitor my network usage for various reasons, but recently my favourite decided to take the step away from being a free tool. Instead of tracking down another, I decided to use this opportunity to start a new project of my own, and use it as an [...]]]></description>
			<content:encoded><![CDATA[<p>I have always been using a small tool to monitor my network usage for various reasons, but recently my favourite decided to take the step away from being a free tool. Instead of tracking down another, I decided to use this opportunity to start a new project of my own, and use it as an opportunity to take a look at <a href="http://en.wikipedia.org/wiki/Windows_Presentation_Foundation" target="_blank">WPF </a>for the first time.<br />
<a rel="attachment wp-att-103" href="http://nocture.dk/software/netmeter/netmeter"><img class="alignright size-full wp-image-103" title="NetMeter" src="http://nocture.dk/wp-content/uploads/NetMeter.png" alt="" width="255" height="56" /></a> Currently it simply displays your network usage, but should only be considered an appetizer in its current state &#8211; I got some ideas lined up to give this some more sweet features!</p>
<p>Head over to the new page and try it right away if you want &#8211; <a href="http://nocture.dk/software/netmeter">nocture.dk/software/netmeter</a></p>
]]></content:encoded>
			<wfw:commentRss>http://nocture.dk/archives/116/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Dijkstra&#8217;s algorithm in C#</title>
		<link>http://nocture.dk/archives/32</link>
		<comments>http://nocture.dk/archives/32#comments</comments>
		<pubDate>Sun, 25 Oct 2009 19:11:07 +0000</pubDate>
		<dc:creator>Jeppe Andersen</dc:creator>
				<category><![CDATA[Code]]></category>
		<category><![CDATA[.NET]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[C#]]></category>

		<guid isPermaLink="false">http://nocture.dk/?p=32</guid>
		<description><![CDATA[I had the pleasure of working with this algorithm one year ago during a project on route planning. Recently I encountered this algorithm again during a course, and decided to do a small implementation of this algorithm along with a graphical interface to use it. Use it for anything you want. It finds the shortest [...]]]></description>
			<content:encoded><![CDATA[<p>I had the pleasure of working with this algorithm one year ago during a project on route planning. Recently I encountered this algorithm again during a course, and decided to do a small implementation of this algorithm along with a graphical interface to use it. Use it for anything you want.</p>
<p>It finds the shortest path from a starting point to all nodes in a graph, but keeps track of how to get there, so if you want to use it for the shortest path between 2 points, simply follow the previous node located in <em>path </em>from the destination point.</p>
<p><a href="http://www.nocture.dk/data/Dijkstra.zip">http://www.nocture.dk/data/Dijkstra.zip</a></p>
]]></content:encoded>
			<wfw:commentRss>http://nocture.dk/archives/32/feed</wfw:commentRss>
		<slash:comments>7</slash:comments>
		</item>
	</channel>
</rss>

