By shriphani on May 20, 2010
Two implementations of a disjoint set data structure and an implementation of kruskal's algorithm.
Posted in Computer Science, python | Tagged "disjoint sets", "kruskal", "path compression", "weighted union", algorithms, analysis of algorithms, Computer Science, cs, purdue, python | Leave a response
By shriphani on April 30, 2010
This semester I had the fortune of taking Dr. Greg Frederickson's CS 381 (Algorithms) class. And boy did I see weird stuff in there. Below, I have a list of analyses I say are downright the most non-obvious (and in a way beautiful to look at). Edmonds-Karp Algorithm (Max Flow in a network): This algorithm [...]