Introduction
We already know what about the topological sort of a directed acyclic graph. So why do we need to revisit this algorithm? First of all I never...
2 replies - 6819 views - 12/11/12 by Stoimen Popov in Articles
On Monday evening, 3rd December, 2012, I went along to the British Computer Society London in the Strand for a lecture from none other than Professor...
0 replies - 2847 views - 12/07/12 by Peter Pilgrim in Articles
Introduction
A very common problem in computer programming is finding the longest increasing (decreasing) subsequence in a sequence of numbers (usually...
1 replies - 8090 views - 12/04/12 by Stoimen Popov in Articles
Recently I’ve undertaken a personal project (computoser) that is a bit strange. I tried to write software that generates music at random. Good...
0 replies - 1699 views - 11/30/12 by Bozhidar Bozhanov in Articles
Introduction
Strassen’s method of matrix multiplication is a typical divide and conquer algorithm. We’ve seen so far some divide and conquer algorithms...
0 replies - 8078 views - 11/27/12 by Stoimen Popov in Articles
Introduction
Along with Kruskal’s minimum spanning tree algorithm, there’s another general algorithm that solves the problem. The algorithm of...
2 replies - 7946 views - 11/20/12 by Stoimen Popov in Articles
Introduction
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 - 8429 views - 11/13/12 by Stoimen Popov in Articles
Introduction
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 - 6821 views - 11/06/12 by Stoimen Popov in Articles
Introduction
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 - 6268 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 - 5610 views - 10/29/12 by Mitch Pronschinske in Articles
Introduction
As we saw in the previous post, Dijkstra's algorithm
is very useful when it comes to finding all the shortest paths in a
weighted graph....
1 replies - 9734 views - 10/22/12 by Stoimen Popov in Articles
Introduction
We already know how we can find the shortest paths in a graph
starting from a given vertex. Practically we modified breadth-first
search in...
0 replies - 11110 views - 10/15/12 by Stoimen Popov in Articles
Introduction
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 - 9767 views - 10/09/12 by Stoimen Popov in Articles
Introduction
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 - 5701 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 - 6903 views - 09/17/12 by Baptiste Wicht in Articles
