Force-Directed Layout Methods

This chapter describes force-directed layout algorithms, which model the input graph as a system of forces and try to find a minimum energy configuration of this system. SpringLayout is best suited for undirected, sparse graphs, e.g., free trees. TutteLayout can draw a planar, triconnected graph with convex faces, but it can also be applied to non-planar graphs.