مقاله انگلیسی رایگان در مورد الگوریتم های بهینه سازی و اجرا در ترسیم گراف – الزویر 2019

1. Introduction

2. Related Work

3. The Implement of Algorithms

4. FR Algorithm

5. Conclusions

Acknowledgements

References

In the process of engineering applications, we often use a large number of vertices and edges to represent the complex system model, but sometimes the model is so complex that it is impossible to draw the graph neatly and beautifully by hand. So how to draw the graph automatically using the computer and how to make the graph visual become an important research topic. Based on the study on the genetic algorithm, SHLA algorithm and FR algorithm, we implement these algorithms by analyzing the pseudo-codes. Especially we focus on the study of the source programming about FR-boost and then implement an improved FR algorithm that selects XML document as the input and output graph files. It can effectively reduce the complexity of algorithm and increase the point-line graph’s visualization.

Introduction

With the development of Internet, graphical data is in everywhere. In the face of these massive graphic data, we often use the statistical analysis and data mining methods to extract the useful information. However most extracted result is unreadable, we have a strong demand of graph visualization. The study of algorithms for graph drawing and graph visualization has a long history, until now all kinds of new algorithms are emerging in succession. They are widely used in network management, program visualization, software engineering and the computer aided teaching. So it is very important to study the graph visualization and the design algorithm. In this paper, the layout algorithm of two-dimensional point-line graph is studied. Based on the study and analysis of pseudo-codes, we program and implement these algorithms, at the same time the visualization test graphs are provided. Further, an improved FR optimization algorithm is designed and programmed to increase the visualization degree of point-line graph.