Fruchterman-Reingold AlgorithmDescribed in Fruchterman, T., E. Reingold. Graph drawing by force-directed placement. Software---Practice and Experience, 21(11):1129-1164, 1991.This is a simple algorithm for laying out arbitrary complex graphs in an aesthetically pleasing manner. It initially lays out vertices in a random placement, then iteratively pushes vertices that are not connected apart while bringing vertices that are connected closer together. |