# Tag Archives: MST

## Reverse Delete Algorithm for Minimum Spanning TreeFebruary 18, 2017

Reverse Delete algorithm is closely related to Kruskal’s algorithm. In Kruskal’s algorithm what we do is : Sort edges by increasing order of their weights.… Read More »

## Total number of Spanning Trees in a GraphFebruary 1, 2017

If a graph is a complete graph with n vertices, then total number of spanning trees is n(n-2) where n is the number of nodes… Read More »

## Minimum Product Spanning TreeDecember 12, 2016

Given a connected and undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all the vertices together.… Read More »

## Kruskal’s Minimum Spanning Tree using STL in C++May 16, 2016

Given an undirected, connected and weighted graph, find Minimum Spanning Tree (MST) of the graph using Kruskal’s algorithm. Input : Graph as an array of… Read More »

## Prim’s algorithm using priority_queue in STLMarch 22, 2016

Given an undirected, connected and weighted graph, find Minimum Spanning Tree (MST) of the graph using Prim’s algorithm. Input : Adjacency List representation of above… Read More »

## Steiner Tree ProblemJune 16, 2015

What is Steiner Tree? Given a graph and a subset of vertices in the graph, a steiner tree spans though the given subset.

## Greedy Algorithms | Set 9 (Boruvka’s algorithm)May 20, 2015

We have discussed following topics on Minimum Spanning Tree. Applications of Minimum Spanning Tree Problem Kruskal’s Minimum Spanning Tree Algorithm

## Travelling Salesman Problem | Set 2 (Approximate using MST)November 4, 2013

We introduced Travelling Salesman Problem and discussed Naive and Dynamic Programming Solutions for the problem in the previous post,. Both of the solutions are infeasible.

## Greedy Algorithms | Set 6 (Prim’s MST for Adjacency List Representation)November 23, 2012

We recommend to read following two posts as a prerequisite of this post.

## Greedy Algorithms | Set 2 (Kruskal’s Minimum Spanning Tree Algorithm)October 30, 2012

What is Minimum Spanning Tree? Given a connected and undirected graph, a spanning tree of that graph is a subgraph that is a tree and… Read More »

## Boruvka’s algorithm for Minimum Spanning TreeMarch 29, 2011

Following two algorithms are generally taught for Minimum Spanning Tree (MST) problem.

## Applications of Minimum Spanning Tree ProblemMarch 4, 2011

Minimum Spanning Tree (MST) problem: Given connected graph G with positive edge weights, find a min weight set of edges that connects all of the… Read More »