Graduate Algorithms

On Monday, we’ll cover the various algorithms for computing a minimum spanning tree of a graph. A very nice applet that demonstrates both Prim’s and Kruskal’s algorithm for the MST can be found here.

Note: Monday’s lecture will be in MEB 3147, instead of MEB 3105. This is a one-time shift, only for this Monday’s lecture.

Some useful links:

• A proof of Cayley’s theorem by Edsger Dijkstra.
• Priority queue applet (as implemented via a heap or array)
• The Union Find data structure (two applets)

Slides for today’s lecture are a lightly modified version of Kevin Wayne’s slides (pdf) accompanying the textbook.

This entry was posted on Saturday, September 15th, 2007 at 12:54 am and is filed under Lectures, News.