tag:blogger.com,1999:blog-8888552847404585956.post8006323149642063239..comments2023-04-04T06:08:09.077-07:00Comments on bababadalgharaghtakamminarronnkonnbro: The Kempe Tree: A Simple Data Structure for Supporting Range Updates or QueriesAnonymoushttp://www.blogger.com/profile/04555325011016161229noreply@blogger.comBlogger3125tag:blogger.com,1999:blog-8888552847404585956.post-56276295340354274802015-03-30T09:46:43.006-07:002015-03-30T09:46:43.006-07:00Brilliant data structure! I've used it with N ...Brilliant data structure! I've used it with N = n (instead of a power of 2) and to implement Dijkstra's algorithm more efficiently.aurelduhttps://www.blogger.com/profile/09414794127777915059noreply@blogger.comtag:blogger.com,1999:blog-8888552847404585956.post-38296717033765139792015-03-30T09:38:32.024-07:002015-03-30T09:38:32.024-07:00This comment has been removed by the author.aurelduhttps://www.blogger.com/profile/09414794127777915059noreply@blogger.comtag:blogger.com,1999:blog-8888552847404585956.post-79857697187523451192013-03-31T02:32:05.950-07:002013-03-31T02:32:05.950-07:00How is it different from segment tree?How is it different from segment tree?aayushhttps://www.blogger.com/profile/02373555282535470899noreply@blogger.com