<?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>Tue, 22 May 2012 18:24:00 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
	<item>
		<title>By: Mz Rokz</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-7379</link>
		<dc:creator>Mz Rokz</dc:creator>
		<pubDate>Thu, 10 May 2012 09:06:48 +0000</pubDate>
		<guid isPermaLink="false">http://electrofriends.com/?p=1024#comment-7379</guid>
		<description>You enterd 4 vertices and your output connected only 3 of them....
Secondly, the output you displayed is making a cycle between vertices 1 2 &amp; 3 which is wrong.
Your algorithm is bullshit..........</description>
		<content:encoded><![CDATA[<p>You enterd 4 vertices and your output connected only 3 of them&#8230;.<br />
Secondly, the output you displayed is making a cycle between vertices 1 2 &amp; 3 which is wrong.<br />
Your algorithm is bullshit&#8230;&#8230;&#8230;.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: jaydee</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-7301</link>
		<dc:creator>jaydee</dc:creator>
		<pubDate>Wed, 18 Apr 2012 04:58:21 +0000</pubDate>
		<guid isPermaLink="false">http://electrofriends.com/?p=1024#comment-7301</guid>
		<description>sorry dude but your program doesn&#039;t work for looping conditions youve gotta eep another counter for loops.</description>
		<content:encoded><![CDATA[<p>sorry dude but your program doesn&#8217;t work for looping conditions youve gotta eep another counter for loops.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: neha</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-7287</link>
		<dc:creator>neha</dc:creator>
		<pubDate>Mon, 16 Apr 2012 04:04:00 +0000</pubDate>
		<guid isPermaLink="false">http://electrofriends.com/?p=1024#comment-7287</guid>
		<description>plz provide necessary info abt d variables used, lyk wats visit, visited etc</description>
		<content:encoded><![CDATA[<p>plz provide necessary info abt d variables used, lyk wats visit, visited etc</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Batercus</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-7256</link>
		<dc:creator>Batercus</dc:creator>
		<pubDate>Mon, 09 Apr 2012 13:35:45 +0000</pubDate>
		<guid isPermaLink="false">http://electrofriends.com/?p=1024#comment-7256</guid>
		<description>thanks a lot..</description>
		<content:encoded><![CDATA[<p>thanks a lot..</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: shalini</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-7188</link>
		<dc:creator>shalini</dc:creator>
		<pubDate>Thu, 29 Mar 2012 09:50:57 +0000</pubDate>
		<guid isPermaLink="false">http://electrofriends.com/?p=1024#comment-7188</guid>
		<description>thank u for your program</description>
		<content:encoded><![CDATA[<p>thank u for your program</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: sdkarthi</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-7167</link>
		<dc:creator>sdkarthi</dc:creator>
		<pubDate>Tue, 27 Mar 2012 01:37:59 +0000</pubDate>
		<guid isPermaLink="false">http://electrofriends.com/?p=1024#comment-7167</guid>
		<description>good and thanks</description>
		<content:encoded><![CDATA[<p>good and thanks</p>
]]></content:encoded>
	</item>
	<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>

