<?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>Doing &#38; Done &#187; radial graph</title>
	<atom:link href="http://doing.liduan.com/tag/radial-graph/feed/" rel="self" type="application/rss+xml" />
	<link>http://doing.liduan.com</link>
	<description>Record and Store</description>
	<lastBuildDate>Sat, 29 Oct 2011 11:13:24 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
		<item>
		<title>relationship graph algorithms also can c &#8230;</title>
		<link>http://doing.liduan.com/2008/11/25/relationship-graph-algorithms-also-can-c/</link>
		<comments>http://doing.liduan.com/2008/11/25/relationship-graph-algorithms-also-can-c/#comments</comments>
		<pubDate>Tue, 25 Nov 2008 15:25:38 +0000</pubDate>
		<dc:creator>liduan</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[document]]></category>
		<category><![CDATA[graph]]></category>
		<category><![CDATA[radial graph]]></category>
		<category><![CDATA[spring graph]]></category>
		<category><![CDATA[tutorial]]></category>

		<guid isPermaLink="false">http://doing.liduan.com/2008/11/25/relationship-graph-algorithms-also-can-c/</guid>
		<description><![CDATA[relationship graph algorithms also can call Radial or Spring graph algorithm. I have found some tutorials. 1. Graph Algorithms using SPIRAL, I think SPIRAL is a software, but I can&#8217;t find any more about it. 2. a document about Using Spring Algorithms to Remove Node Overlapping 3.]]></description>
			<content:encoded><![CDATA[<p>relationship graph algorithms also can call  Radial or Spring graph algorithm. I have found some tutorials.<br />
1. <a title="Graph Algorithms using SPIRAL" href="http://www2.isye.gatech.edu/~mgoetsch/cali/Spiral/Spiral%20HTML%20Help/GraphAlgorithms.htm">Graph Algorithms using SPIRAL</a>, I think SPIRAL is a software, but I can&#8217;t find any more about it.</p>
<p>2. <a title="a document about Using Spring Algorithms to Remove Node Overlapping" href="http://crpit.com/confpapers/CRPITV45Li.pdf">a document about Using Spring Algorithms to Remove Node Overlapping</a><br />
3. </p>
]]></content:encoded>
			<wfw:commentRss>http://doing.liduan.com/2008/11/25/relationship-graph-algorithms-also-can-c/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

