哪位大哥帮我翻译一下论文摘要.(图遍历,C语言,TC绘图方面的)

来源:百度知道 编辑:UC知道 时间:2024/05/31 13:07:02
摘 要
为了直观阐述无向图在开发平台下通过深度和广度优先遍历算法的路径,本设计先简要介绍图论的发展历程,接着使用C语言在Win-Tc开发平台上通过以结构体中的二维数组形式存储图的邻接矩阵,再用深度优先遍历算法或者广度优先遍历算法求出相应的遍历顶点顺序,再通过绘图函数把邻接矩阵和遍历顺序作图形化演示,这样图结构转换为直观图形,绘制在屏幕上。其中图结构进行广度遍历时用了队列;进行深度遍历时用了函数递归方法。在画图中的顶点时采用的方法是以屏幕中心点为圆心,取适当长度的半径,围成一个圆。各顶点相互以平均的弧度距离坐落在圆周上。用连线函数以不同的颜色把图结构和遍历顶点顺序描绘出来。经历了本次设计,对掌握图的基本理论,深度广度两种遍历的方法,C语言的使用,图形的绘制方法均有很大的帮助。

关键词:深度优先遍历算法;广度优先遍历算法;邻接矩阵;图形化演示;C语言

Abstract
This graph is directly in order to develop the workbench in width and depth by traversing algorithm is the path, the design is briefly introduced the first graph theory, then use C development of language in the developing platform to Tc via a two-dimensional array of structure stored graph adjacency matrix, reoccupy depth-first traversing algorithm or breadth-first traversing algorithm corresponding traverse sequence, again through the vertex drawing function the adjacency matrix and traverse sequence, such as graphical demonstration for structural chart drawing graphics, intuitive on the screen. One figure structure in the queue again took breadth, With the in-depth times last recursive functions. At the height of the drawing method is adopted for the center, take center screen the radius of the proper length, in a circle. Each vertex in average distance of each radian located in circumference. In connection with the function of different color map structure and trav