Force-directed graph drawing

（重定向自Layout algorithm）

Visualization of links between pages on a wiki using a force-directed layout.

Force-directed graph drawing algorithms are a class of algorithms for drawing graphs in an aesthetically pleasing way. Their purpose is to position the nodes of a graph in two-dimensional or three-dimensional space so that all the edges are of more or less equal length and there are as few crossing edges as possible, by assigning forces among the set of edges and the set of nodes, based on their relative positions, and then using these forces either to simulate the motion of the edges and nodes or to minimize their energy.

单词	Layout algorithm
释义	Layout algorithm 英语百科 Force-directed graph drawing （重定向自Layout algorithm） Force-directed graph drawing algorithms are a class of algorithms for drawing graphs in an aesthetically pleasing way. Their purpose is to position the nodes of a graph in two-dimensional or three-dimensional space so that all the edges are of more or less equal length and there are as few crossing edges as possible, by assigning forces among the set of edges and the set of nodes, based on their relative positions, and then using these forces either to simulate the motion of the edges and nodes or to minimize their energy.
随便看	eneamines enearnest Enea Silvio Piccolomini enea silvio piccolominis eneastylos enebrie Enecat enecate enecation En echelon en echelon arrangement en echelon fault en echelon fault blocks en echelon faults en echelon folds en echelon joint en echelon joints en echelon structure enechema enecia eneclann Enedina Enediol enediolate enediols