Shortcut for chapter specific information

Friday, September 2, 2011

Chapter 21 : Disjoint Set

Quickly browse it once.  Except Chapter 21.4 which involved the proof of union rank heuristics, it is not a very difficult chapter to read.

I like this, may be I will read in leisure of the chapters in graph as well.  There are around 20% of the Data Structure required understanding of the graph algorithms.


No comments:

Post a Comment