Problem Solving

Mon, 03 Nov 2014 00:00:00 +0000

One of my friends approached me with an algorithm problem the other day. Here’s the short version of it.

Given an undirected weighted graph where E=V find the minimum spaning tree in O(V) time.
E = Number of edges.
V = Number of vertices.

Now my friend had tried a few different things relating to finding an MST. Prim’s and Kruskal’s algorithms were brought up, but both couldn’t be modified such that they would solve the problem in O(V) time.

Algorithms on A Day In The Woods

Problem Solving