Tuesday, 15 January 2013

Kruskal's Algorithm


By on 03:09

Kruskal's Algorithm are those algorithm which is used to find shortest minimum spamming tree(weight of edges are minimal).This Algorithm is used in c,c++,java,c# etc.

Example:-


Step 1:-Arrange the vertex in increasing order of weight.

Step 2:-Add the edges until it becomes cyclic (n-1 edges).

Step 3:-Exit code.

Solution:-


Kruskal Algorithm(in graph)




If you have any query then leave your comments and don't forgot to follow me on Google+,Facebook,Twitter.

0 comments:

Post a Comment

Related Posts Plugin for WordPress, Blogger...