Graph Layout using force based approach
Автор: badmephisto
Загружено: 2008-11-23
Просмотров: 20073
Graph Layout, I programmed it in Python using Pygame for drawing.
Graph Layout problem: Given a graph G, display the graph on plane in a "nice" way. (Of course "nice" is hard to define mathematically :))
One approach to solving the problem is defining an energy function of the graph based on relative distances of all nodes, and also taking into account all of the edges. An iterative minimum seeking algorithm is used to greedily push the graph towards the most promising direction. The problem of course comes in when there is a non-trivial arrangement that is best overall, but the algorithm will never find it because it would have to temporarily make the graph worse. To overcome this problem, usually a graph layout is generated at random a couple hundred times, and then the best graph is chosen at the end. Optimality is clearly not guaranteed.
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
![Tips/Tricks for learning OLL/PLL [New!]](https://ricktube.ru/thumbnail/0Id44xvrvWo/mqdefault.jpg)
