13,704,865 members
alternative version

#### Stats

132.7K views
69 bookmarked
Posted 1 Mar 2011
Licenced CPOL

# Kruskal Algorithm

, 5 Jul 2012
Implementation of Kruskal Algorithm in C#

## Introduction

According to Wikipedia:"Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connectedweighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. If the graph is not connected, then it finds a minimum spanning forest (a minimum spanning tree for each connected component). Kruskal's algorithm is an example of a greedy algorithm."

In short, Kruskal's algorithm is used to connect all nodes in a graph, using the least cost possible.

#### Example

A cable TV company is laying a cable in a new neighborhood. An internet cafe is connecting all PCs via network.

## Using the Demo

Click anywhere to plot the vertices. Hold down ctrl and select two vertices to create an edge. A popup window appears to enter edge cost. Having finished plotting the graph, click Solve.

## Using the Code

`IList<Edge> Solve(IList<Edge> graph, out int totalCost);  `

How the Graph is formed with GDI is not covered as it is irrelevant.

## Classes

Typically, our graph consists of two components, Vertices, and Edges connecting these vertices.

Each Edge is marked by a value or weight, which is the Cost of connecting the two vertices.

### Vertex

Holds:

• Vertex Name (which must be unique within Graph) and its Drawing Point
• Rank and Root (we'll get to those later)
```using System;
using System.Drawing;

namespace Kruskal
{
public class Vertex
{
#region Members

private int name;

#endregion

#region Public Properties

public int Name
{
get
{
return name;
}
}

public int Rank { get; set; }

public Vertex Root { get; set; }

public Point Position { get; set; }

#endregion

#region Constructor

public Vertex(int name, Point position)
{
this.name = name;
this.Rank = 0;
this.Root = this;
this.Position = position;
}

#endregion

#region Methods

internal Vertex GetRoot()
{
if (this.Root != this)// am I my own parent ? (am i the root ?)
{
this.Root = this.Root.GetRoot();// No? then get my parent
}

return this.Root;
}

internal static void Join(Vertex root1, Vertex root2)
{
if (root2.Rank < root1.Rank)//is the rank of Root2 less than that of Root1 ?
{
root2.Root = root1;//yes! then Root1 is the parent of Root2 (since it has the higher rank)
}
else //rank of Root2 is greater than or equal to that of Root1
{
root1.Root = root2;//make Root2 the parent
if (root1.Rank == root2.Rank)//both ranks are equal ?
{
root2.Rank++;//increment Root2, we need to reach a single root for the whole tree
}
}
}

#endregion
}
} ```

### Edge

Holds two Vertices, Cost of connection between them, and CostDrawing Point.

Note that it implements `IComparable`, we'll need it to sort Edges by Cost later on.

```using System;
using System.Drawing;

namespace Kruskal
{
public class Edge : IComparable
{
#region Members

private Vertex v1, v2;
private int cost;
private Point stringPosition;

#endregion

#region Public Properties

public Vertex V1
{
get
{
return v1;
}
}

public Vertex V2
{
get
{
return v2;
}
}

public int Cost
{
get
{
return cost;
}
}

public Point StringPosition
{
get
{
return stringPosition;
}
}

#endregion

#region Constructor

public Edge(Vertex v1, Vertex v2, int cost, Point stringPosition)
{
this.v1 = v1;
this.v2 = v2;
this.cost = cost;
this.stringPosition = stringPosition;
}

#endregion

#region IComparable Members

public int CompareTo(object obj)
{
Edge e = (Edge)obj;
return this.cost.CompareTo(e.cost);
}

#endregion
}
} ```

## Algorithm Implementation

### Sorting Edges

Edges are sorted in ascending order according to Cost using Quick Sort.

### Making Sets

Initially, every Vertex is its own Root and has rank zero.

```public Vertex(int name, Point position)
{
this.name = name;
this.Rank = 0;
this.Root = this;
this.Position = position;
}
```

## Why This Step?

We need it to ensure that, on adding our Vertices, we are not forming a loop.

Consider this example:

The Edge BD was not considered, because B,D are already connected through B,A,D.

Thus, for every Edge we examine, we must inspect that its two Vertices belong to different sets (trees).

## How To Find Out If Two Vertices Are In Different Sets?

Using the recursive function `GetRoot()`.

```internal Vertex GetRoot()
{
if (this.Root != this)// am I my own parent ? (am i the root ?)
{
this.Root = this.Root.GetRoot();// No? then get my parent
}

return this.Root;
} ```

If roots are indeed different, (each Vertex is in a different set), `Join()` the two Vertices.

```internal static void Join(Vertex root1, Vertex root2)
{
if (root2.Rank < root1.Rank)//is the rank of Root2 less than that of Root1 ?
{
root2.Root = root1;//yes! then Root1 is the parent of Root2 (since it has the higher rank)
}
else //rank of Root2 is greater than or equal to that of Root1
{
root1.Root = root2;//make Root2 the parent
if (root1.Rank == root2.Rank)//both ranks are equal ?
{
root2.Rank++;//increment Root2, we need to reach a single root for the whole tree
}
}
} ```

## Conclusion

Hope I delivered a clear explanation.

## Share

 Software Developer Egypt
Enthusiastic programmer/researcher, passionate to learn new technologies, interested in problem solving, data structures, algorithms, AI, machine learning and nlp.

Amateur guitarist/ keyboardist, squash player.

## You may also be interested in...

 Re: This is a masterpiece Omar Gameel Salem13-Oct-13 6:34 Omar Gameel Salem 13-Oct-13 6:34
 aaa 1-Oct-13 20:35 1-Oct-13 20:35
 What compiler you use?? thanks :) Afdolol9-May-13 23:09 Afdolol 9-May-13 23:09
 Re: What compiler you use?? thanks :) Omar Gameel Salem10-May-13 2:53 Omar Gameel Salem 10-May-13 2:53
 My vote of 5 Kenneth Haugland10-Aug-12 23:00 Kenneth Haugland 10-Aug-12 23:00
 My vote of 5 Abinash Bishoyi6-Apr-12 3:05 Abinash Bishoyi 6-Apr-12 3:05
 My vote of 5 Manoj Kumar Choubey27-Mar-12 23:44 Manoj Kumar Choubey 27-Mar-12 23:44
 My Vote of 5 RaviRanjanKr30-Dec-11 4:58 RaviRanjanKr 30-Dec-11 4:58
 Re: My Vote of 5 mobilat30-Dec-11 6:39 mobilat 30-Dec-11 6:39
 Quick sort mobilat28-Dec-11 22:48 mobilat 28-Dec-11 22:48
 My vote of 5 al13n9-Oct-11 21:42 al13n 9-Oct-11 21:42
 Some responses to unjustified criticisms [modified] AndyUk0611-Sep-11 4:02 AndyUk06 11-Sep-11 4:02
 Re: Some responses to unjustified criticisms Omar Gameel Salem11-Sep-11 4:09 Omar Gameel Salem 11-Sep-11 4:09
 Re: Some responses to unjustified criticisms AndyUk0611-Sep-11 6:52 AndyUk06 11-Sep-11 6:52
 My vote of 5 AndyUk069-Sep-11 1:01 AndyUk06 9-Sep-11 1:01
 My vote of 5 naser abu khas2-Apr-11 14:24 naser abu khas 2-Apr-11 14:24
 My vote of 5 paryj9-Mar-11 18:36 paryj 9-Mar-11 18:36
 My vote of 5 EyalSch28-Mar-11 4:57 EyalSch2 8-Mar-11 4:57
 My vote of 1 JV99992-Mar-11 4:16 JV9999 2-Mar-11 4:16
 My vote of 1 Petr Pechovic2-Mar-11 0:57 Petr Pechovic 2-Mar-11 0:57
 Re: My vote of 1 Omar Gameel Salem2-Mar-11 1:54 Omar Gameel Salem 2-Mar-11 1:54
 Re: My vote of 1 Petr Pechovic2-Mar-11 7:58 Petr Pechovic 2-Mar-11 7:58
 Re: My vote of 1 Omar Gameel Salem2-Mar-11 21:33 Omar Gameel Salem 2-Mar-11 21:33
 Re: My vote of 1 Dave Kreskowiak2-Mar-11 9:05 Dave Kreskowiak 2-Mar-11 9:05
 Re: My vote of 1 M i s t e r L i s t e r2-Mar-11 12:36 M i s t e r L i s t e r 2-Mar-11 12:36
 Last Visit: 31-Dec-99 18:00     Last Update: 22-Sep-18 4:49 Refresh 12 Next »