Along with Kruskal’s minimum spanning tree algorithm, there’s another general algorithm that solves the problem. The algorithm of...
2 replies - 11790 views - 11/20/12 by Stoimen Popov in Articles
One of the two main algorithms in finding the minimum spanning tree algorithms is the algorithm of Kruskal. Before getting into the details,...
0 replies - 10295 views - 11/13/12 by Stoimen Popov in Articles
Here’s a classical task on graphs. We have a group of cities and we
must wire them to provide them all with electricity. Out of all...
0 replies - 7770 views - 11/06/12 by Stoimen Popov in Articles
We saw how to find the shortest path in a graph with positive edges using the Dijkstra’s algorithm.
We also know how to find the shortest...
0 replies - 7828 views - 10/29/12 by Stoimen Popov in Articles
Originally posted by Eric Burnett, a software engineer at Google on thelowlyprogrammer.comThe human brain has the best storage system on the block in a lot of...
0 replies - 6148 views - 10/29/12 by Mitch Pronschinske in Articles
As we saw in the previous post, Dijkstra's algorithm
is very useful when it comes to finding all the shortest paths in a
1 replies - 14136 views - 10/22/12 by Stoimen Popov in Articles
We already know how we can find the shortest paths in a graph
starting from a given vertex. Practically we modified breadth-first
0 replies - 15140 views - 10/15/12 by Stoimen Popov in Articles
Since with graphs we can represent real-life problems it’s almost
clear why we would need an efficient algorithm that calculates the...
3 replies - 11928 views - 10/09/12 by Stoimen Popov in Articles
So far we know how to implement graph depth-first and breadth-first
searches. These two approaches are crucial in order to understand graph...
0 replies - 6988 views - 09/25/12 by Stoimen Popov in Articles
To be sure to be well prepared for an interview, I decided to read several Algorithms book. I also chosen books in order to have information about data...
1 replies - 8845 views - 09/17/12 by Baptiste Wicht in Articles
Since we already know how to represent graphs,
we can go further for some very simple approaches of walking through
them. Passing by all the vertices of a...
4 replies - 13515 views - 09/10/12 by Stoimen Popov in Articles
Quick sort is the fastest known comparision sort for arrays. To top
it, it could be done in-place for arrays. For Linked Lists, Merge Sort
might be a...
6 replies - 9551 views - 09/07/12 by Arun Manivannan in Articles
Although this post is supposed to be about algorithms I’ll cover more
on graphs and their computer representation. I consider this very...
1 replies - 10777 views - 09/04/12 by Stoimen Popov in Articles
From Wikipedia - "Streaming algorithms are algorithms for processing data streams in which the input is presented as a sequence of items and can be...
0 replies - 3909 views - 09/02/12 by Nishant Chandra in Articles
Here’s one task related to the tree data structure. Given two nodes, can you find their lowest common ancestor?
As a matter of fact, this...
0 replies - 8898 views - 08/27/12 by Stoimen Popov in Articles