<?xml version='1.0'?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:georss="http://www.georss.org/georss" >
<channel>
	<title><![CDATA[Congrazie: Routing algorthm in graphs (hypercube and regular graphs).Visual application with OpenGl. - repost by adrianstancu]]></title>
	<link>http://congrazie.ro/bookmarks/view/9160/routing-algorthm-in-graphs-hypercube-and-regular-graphsvisual-application-with-opengl-repost-by-adrianstancu</link>
	<description><![CDATA[]]></description>
	
	<item>
  <guid isPermaLink="true">https://congrazie.ro/bookmarks/view/9160/routing-algorthm-in-graphs-hypercube-and-regular-graphsvisual-application-with-opengl-repost-by-adrianstancu</guid>
  <pubDate>Sat, 22 Jun 2013 20:11:00 +0000</pubDate>
  <link>https://congrazie.ro/bookmarks/view/9160/routing-algorthm-in-graphs-hypercube-and-regular-graphsvisual-application-with-opengl-repost-by-adrianstancu</link>
  <title><![CDATA[Routing algorthm in graphs (hypercube and regular graphs).Visual application with OpenGl. - repost by adrianstancu]]></title>
  <description><![CDATA[I need a visual application that simulates the following algorithms:       1) Fault tolerant routing algorithm in hypercube. It is described in detail in the attached pdf.  2) Algorithm for finding k shortest disjoint path-pair between nodes in regular graphs( see attached doc )... (Budget: $30-$250 USD, Jobs: C Programming, C++ Programming, OpenGL)<p>Address of the bookmark: <a href="http://www.freelancer.com/projects/doreloprisan_4651386.html" rel="nofollow">http://www.freelancer.com/projects/doreloprisan_4651386.html</a></p>]]></description>
  <dc:creator>Administrator</dc:creator>
</item>

</channel>
</rss>