TelBook

graph drower MFC with dynamic scaling y-axis

vb笔记本电池电量检测程序,有兴趣的就下载吧。(vb laptop battery detection procedures are interested to download it.)

To achieve similar WORD2000 clip art menu code

说明：  一个简单的ply读取文件，里边附了我收集的二十几个ply模型文件，希望能对大家有所帮助(a simple ply read and display file with more than 20 ply models)

考试系统 vb编程 西工大 平时实验 (test systems)

在windows2000,windows XP,2003上修改网卡IP地址并编程使之生效(In Windows 2003, Windows XP, 2003, modified on the network card IP address and programming into law)

是一个万年历功能的程序，可以查询某年某天是星期几(A year of day is a calendar function, you can query the day of the week)

编写C程序，随机给出n*n的邻接矩阵，并打印输出邻接矩阵，以及有向图的边的个数，每个顶点的度，并判断该图中是否存在Euler回路： （1）如果为n阶，则随机产生一个n*n的邻接矩阵； （2）输出邻接矩阵，边的个数，每个顶点的度以及图中是否存在Euler回路。 这个题目涉及到了两个主要的知识点，一个是数据结构中的有向图的邻接矩阵的创建，还有就是离散数学中的Euler回路的判定定理。(The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.)

用C++实现的贪吃蛇游戏程序，对游戏的设计思路有比较详细的讲解。(no )

分治法思想，求最邻近点对，考虑将所给的n个点的集合S分成2个子集S1和S2，每个子集中约有n/2个点，然后在每个子集中递归地求其最接近的点对(Divide and conquer ideas, find the nearest point to consider given the set S of n points into two subsets S1 and S2, each subset of about n/2 points, and then recursively find its focus in each sub-the closest point)