Drawing graphs nicely using simulated annealing

The paradigm of simulated annealing is applied to the problem of drawing graphs ''nicely.'' Our algorithm deals with general undirected graphs with straight-line edges, and employs several simple criteria for the aesthetic quality of the result. The algorithm is flexible, in that the relative weights of the criteria can be changed. For graphs of modest size it produces good results, competitive with those produced by other methods, notably, the ''spring method'' and its variants.