;; Kruskal's Algorithm and UnionFind ;; So I want to try out my version of unionfind on the inspiration for it, Kruskal's algorithm ;; Here's my attempt: (defn makeunionfind [elts] (apply hashmap (mapcat (fn[x][x [x [x]]]) elts))) (defn joined? [unionfind a b] (= (first (unionfind a)) (first (unionfind b)))) (defn join [unionfind a b] (let [[leadera _] (unionfind a) [leaderb _] (unionfind b)] (if (= leadera leaderb) unionfind ;; nothing to do (let [[_ followersa] (unionfind leadera) [_ followersb] (unionfind leaderb)] (if (>= (count followersa) (count followersb)) ;; if a's in the bigger group (let [newfollowers (into followersa followersb)] ;; combine followerlists (let [uf (assoc unionfind leadera [leadera newfollowers])] ;; add the new followers to the 'a group leader' (reduce (fn[uf x] (assoc uf x [leadera []])) uf followersb))) ;; and change every member of the 'b group' to follow the 'a group leader' instead (join unionfind b a)))))) ;; but if a's in the smaller group do it the other way round ;; And here's the data from the original maximumspanningtree problem (def cities ["London" "Birmingham" "Sheffield" "Bristol" "Leeds" "Liverpool" "Manchester"]) (def linkcosts [ ["London" "Birmingham" 103] ["London" "Sheffield" 167] ["London" "Leeds" 175] ["London" "Bristol" 100] ["London" "Liverpool" 178] ["London" "Manchester" 181] ["Birmingham" "Sheffield" 91] ["Birmingham" "Leeds" 92 ] ["Birmingham" "Bristol" 79 ] ["Birmingham" "Liverpool" 75 ] ["Birmingham" "Manchester" 95] ["Sheffield" "Bristol" 180] ["Sheffield" "Leeds" 33] ["Sheffield" "Liverpool" 63] ["Sheffield" "Manchester" 37] ["Bristol" "Leeds" 171] ["Bristol" "Liverpool" 136] ["Bristol" "Manchester" 139] ["Leeds" "Liverpool" 73] ["Leeds" "Manchester" 40] ["Liverpool" "Manchester" 27]]) ;; Kruskal's Algorithm Again: ;; Order the links by cost (def links (sortby (fn[[_ _ b]] b) linkcosts)) ;; And construct an initial partition of the cities (def cityuf (makeunionfind cities)) ;; Kruskal has told us that should go through our list of links in cost order, building ;; only those links which link unlinked things ;; This function takes the partition so far, and the current partially constructed spanning tree ;; and adds a new link to the tree it is building ;; if and only if the link helps (defn addlink [[uf tree] link] (let [a (first link) b (second link)] (if (joined? uf a b) [uf tree] [(join uf a b) (cons link tree)]))) ;; By the Power of Kruskal and by that of UnionFind: (reduce + (map (fn[[_ _ x]] x) (second (reduce addlink [cityuf '()] links)))) ;> 351 (reduce + (map (fn[[_ _ x]] x) (second (reduce addlink [cityuf '()] (reverse links))))) ;> 988 ;; Well, they are surely the same answers as before. ;; How about performance? (time (reduce addlink [(makeunionfind (range 0 10)) '()] (take 10 (repeatedly (fn[] (list (randint 10) (randint 10) (randint 10))))))) "Elapsed time: 3.388981 msecs" (time (reduce addlink [(makeunionfind (range 0 100)) '()] (take 100 (repeatedly (fn[] (list (randint 100) (randint 100) (randint 100))))))) "Elapsed time: 15.278055 msecs" (time (reduce addlink [(makeunionfind (range 0 1000)) '()] (take 1000 (repeatedly (fn[] (list (randint 1000) (randint 1000) (randint 1000))))))) "Elapsed time: 96.710761 msecs" (time (reduce addlink [(makeunionfind (range 0 10000)) '()] (take 10000 (repeatedly (fn[] (list (randint 10000) (randint 10000) (randint 10000))))))) "Elapsed time: 978.454873 msecs" (time (reduce addlink [(makeunionfind (range 0 100000)) '()] (take 100000 (repeatedly (fn[] (list (randint 100000) (randint 100000) (randint 100000))))))) "Elapsed time: 15033.289079 msecs" ;; So far we're looking pretty linear, as I was expecting, but suddenly: (time (reduce addlink [(makeunionfind (range 0 200000)) '()] (take 200000 (repeatedly (fn[] (list (randint 200000) (randint 200000) (randint 200000))))))) "Elapsed time: 129027.687251 msecs" (time (reduce addlink [(makeunionfind (range 0 1000000)) '()] (take 1000000 (repeatedly (fn[] (list (randint 1000000) (randint 1000000) (randint 1000000))))))) "Elapsed time: 500747.749151 msecs" ;; Not sure what happened there! Anyone know?
Blog Archive

▼
2013
(52)

▼
September
(12)
 Efficiency and Progress III : How Close Can We Get...
 Efficiency and Progress II : Behold, C
 Efficiency and Progress : My God, Clojure is Slow!
 How on earth do you program without *recursion*?
 Algorithms II
 Putting it all together : Using UnionFind in Krus...
 Implementing a Data Structure : UnionFind version II
 Implementing a Data Structure: UnionFind
 Kruskal's Algorithm for Minimal Spanning Trees
 The Knapsack Problem : Another Classic Puzzle from...
 Optimal Scheduling : A Classic Puzzle from Compute...
 SVG Graphics in a Clojure Web Application

▼
September
(12)
Search This Blog
Thursday, September 19, 2013
Putting it all together : Using UnionFind in Kruskal's Algorithm
Subscribe to:
Post Comments (Atom)
Thanks for sharing your code !
ReplyDeleteDid you know about https://github.com/jordanlewis/data.unionfind ?
Cheers,
B.
B. Thanks!
DeleteActually I did know about it (in fact I've linked to it in a previous post) but I haven't tried it yet. I want to understand how these things work and the best way is to write one yourself. I intend to make further posts about the lazyunion strategy, if I don't get distracted. I can't imagine anyone's going to be reading them, but I like writing them and it helps get the ideas clear in my mind if I try to explain them to an imaginary readership.