| From: Danny Yoo (dyoo at hashcollision.org) Date: Sun Jan 20 19:58:05 EST 2013 |
|
On Sun, Jan 20, 2013 at 5:23 PM, Matthias Felleisen <matthias at ccs.neu.edu> wrote: > > I thought Limbo Peng wanted to measure the transliteration of some Go algorithm. Wasn't there a remark somewhere that said "there is a faster algorithm based on union-find"? Oh! I'm sorry. I didn't even look at that part of Peng's email, and missed the comment on a faster algorithm. I had no idea what "quick-find" or "quick-union" were.
| Posted on the users mailing list. |
|
![[logo]](/logo.png){kind=logo}