diff options
| author | Josh Haberman <jhaberman@gmail.com> | 2016-04-25 15:04:16 -0700 |
|---|---|---|
| committer | Josh Haberman <jhaberman@gmail.com> | 2016-04-25 15:04:16 -0700 |
| commit | e16ed470be7d0d459e85e1d7b43893358a625d34 (patch) | |
| tree | 6ec5ec5e7fcfc51cce2f6ccda310ce79a3f24303 /upb/refcounted.c | |
| parent | d0c2479920c2f5146deab768d72366f8ca65986e (diff) | |
Updated URL to Tarjan set union paper.
Diffstat (limited to 'upb/refcounted.c')
| -rw-r--r-- | upb/refcounted.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/upb/refcounted.c b/upb/refcounted.c index 6f1ade9..ce06708 100644 --- a/upb/refcounted.c +++ b/upb/refcounted.c @@ -709,7 +709,7 @@ static void merge(upb_refcounted *r, upb_refcounted *from) { * TODO(haberman): this linear algorithm can result in an overall O(n^2) bound * if the user continuously extends a group by one object. Prevent this by * using one of the techniques in this paper: - * ftp://www.ncedc.org/outgoing/geomorph/dino/orals/p245-tarjan.pdf */ + * http://bioinfo.ict.ac.cn/~dbu/AlgorithmCourses/Lectures/Union-Find-Tarjan.pdf */ do { from->group = r->group; } while ((from = from->next) != base); /* Merge the two circularly linked lists by swapping their next pointers. */ |