Another algorithm for carrying out this task is the Fruchterman-Reingold algorithm, which combines attractive and repulsive forces in a manner analogous to nuclear forces and reduces a so-called temperature parameter until an optimal configuration is achieved.
Although originally devised for job scheduling, the Coffman-Graham algorithm can be used to perform this task on layered inputs. Gansner and Koren produced a "circular" algorithm for accomplishing this task, in which performance is improved via an auxiliary routing algorithm. The Kamada-Kawai algorithm for performing this task improved on Eades' heuristic algorithm by using a spring model and making the geometric distance proportional to the topological distance. Another algorithm for carrying out this task is the Fruchterman-Reingold algorithm, which combines attractive and repulsive forces in a manner analogous to nuclear forces and reduces a so-called temperature parameter until an optimal configuration is achieved. Those algorithms are part of a class of force-directed algorithms for performing this task, which seeks to generally minimize edge crossings and equalize edge length. For 10 points, identify this task which consists of visually rendering a structure made up of nodes and edges.
Although originally devised for job scheduling, the Coffman-Graham algorithm can be used to perform this task on layered inputs.
graph drawing or layout