Monthly Archives: August 2011

I just finished a script which executes the Bellman-Ford Algorithm on a randomly generated directed graph (possibly with negative arcs). It can be accessed here. The Bellman Ford algorithm is another shortest path algorithm. Unlike Dijkstra’s algorithm, though, this algorithm … Continue reading →

Tweet

I’ve just added a script which executes Dijkstra’s algorithm on a randomly generated graph. It can be accessed here. Given a weighted graph G and a pair of vertices (s and d), the shortest path problem seeks to find a … Continue reading →

Tweet

I’ve just added a script which executes Kruskal’s algorithm on a randomly generated graph. You can access it here. Given a weighted graph, many times we are interested in finding a minimum spanning tree (MST) for that graph. Prim’s algorithm … Continue reading →

Tweet

I have just written a script of this algorithm that can be accessed here. Given a weighted graph, many times we are interested in finding a minimum spanning tree (MST) for that graph. Prim’s algorithm is a greedy method which … Continue reading →

Tweet

I have just written a script of this algorithm, which can be seen here When we have a collection of lines we wish to know if they all intersect at some point. Many times we are interested in determining what … Continue reading →

Tweet

This program implements Euclid’s Algorithm to reduce a given fraction to lowest terms. This is done by finding the greatest common divisor (GCD) of the numerator and denominator. The GCD of two integers is the largest integer which divides them … Continue reading →

Tweet

I added a program which implements the Sieve of Eratosthenes. This prints out all prime numbers less than a given number by first canceling out all multiples of 2, then all multiples of 3, then all multiples of 5 (multiples … Continue reading →

Tweet