Node Grouping
=============

Automated process for graphs that contain small complete or almost-complete
graphs; abstract these small groups.

Groups must be shown in easily recognizable form, compact, and found quickly.

Find cliques (triangle technique is essentially linear), then fully abstract
groups, use spring layout on superstructure, expand clique, layout again.

Pretty much same CPU time, better maximum edge length, average edge length,
fewer edge crossings.