<?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: C++ programs to implement the Kruskal’s algorithm to generate a minimum cost spanning tree</title>
	<atom:link href="http://electrofriends.com/source-codes/software-programs/cpp-programs/cpp-data-structure/c-programs-to-implement-the-kruskal%e2%80%99s-algorithm-to-generate-a-minimum-cost-spanning-tree/feed/" rel="self" type="application/rss+xml" />
	<link>http://electrofriends.com/source-codes/software-programs/cpp-programs/cpp-data-structure/c-programs-to-implement-the-kruskal%e2%80%99s-algorithm-to-generate-a-minimum-cost-spanning-tree/</link>
	<description>...bringing innovative minds together</description>
	<lastBuildDate>Thu, 09 Feb 2012 18:55:58 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.6</generator>
	<item>
		<title>By: pranoy tez</title>
		<link>http://electrofriends.com/source-codes/software-programs/cpp-programs/cpp-data-structure/c-programs-to-implement-the-kruskal%e2%80%99s-algorithm-to-generate-a-minimum-cost-spanning-tree/comment-page-1/#comment-6239</link>
		<dc:creator>pranoy tez</dc:creator>
		<pubDate>Thu, 17 Nov 2011 13:28:20 +0000</pubDate>
		<guid isPermaLink="false">http://electrofriends.com/?p=1024#comment-6239</guid>
		<description>thnx a lot...</description>
		<content:encoded><![CDATA[<p>thnx a lot&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ishan</title>
		<link>http://electrofriends.com/source-codes/software-programs/cpp-programs/cpp-data-structure/c-programs-to-implement-the-kruskal%e2%80%99s-algorithm-to-generate-a-minimum-cost-spanning-tree/comment-page-1/#comment-6200</link>
		<dc:creator>Ishan</dc:creator>
		<pubDate>Fri, 11 Nov 2011 17:54:30 +0000</pubDate>
		<guid isPermaLink="false">http://electrofriends.com/?p=1024#comment-6200</guid>
		<description>It doesnt work buddy, for cyclic conditions....</description>
		<content:encoded><![CDATA[<p>It doesnt work buddy, for cyclic conditions&#8230;.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: MAYURESH</title>
		<link>http://electrofriends.com/source-codes/software-programs/cpp-programs/cpp-data-structure/c-programs-to-implement-the-kruskal%e2%80%99s-algorithm-to-generate-a-minimum-cost-spanning-tree/comment-page-1/#comment-6168</link>
		<dc:creator>MAYURESH</dc:creator>
		<pubDate>Tue, 08 Nov 2011 04:45:48 +0000</pubDate>
		<guid isPermaLink="false">http://electrofriends.com/?p=1024#comment-6168</guid>
		<description>Hi!
Thanks for the program .
Do you have any idea, so i can implement kruskal&#039;s algorithm with graphics?</description>
		<content:encoded><![CDATA[<p>Hi!<br />
Thanks for the program .<br />
Do you have any idea, so i can implement kruskal&#8217;s algorithm with graphics?</p>
]]></content:encoded>
	</item>
</channel>
</rss>

