chart
Get flash to fully experience Pearltrees
Draw, modify and share flowcharts and other diagrams easily. This online solution has the power and look & feel of a desktop application. It runs entirely on the web, and thus it is an always-on-access-anywhere solution. It meets all your diagramming needs without having to install, maintain and purchase expensive software.
Draw Anywhere - easy online diagramming, flow chart
In the Rooted Clustering section (on the right side of page 3), the section says: "Suppose the algorithm wants to merge clusters C1 and C2 because they are the closest in the system. Before it does so, it checks to see if C1 or C2 contains the root node r. Suppose C1 contains r. C2 is marked for attempting to merge with the root. The algorithm looks for another cluster C3 to merge with C2. C3 must be unmarked and distance(C2,C3)
