Hi, The disjoint set data structure has FIND and UNION operations
for optimized versions of Find we use path compression and for union we use union by rank, which costs O(M log* n) , n is the input size and M the no. of makeset opns. log* n is inverse ackermann's function Can anyone tell me how inverse ackermann's function is related to this method . pls suggest me any idea or article Thanx in advance -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.