25Load_3D_text

采用Kruskal算法求最小生成树主要数据结构 edgeset GE 存放图中的所有边 int n,int e 存放图中的顶点数与边数 edgeset C 存放生成树中的边 vexlist gv 图中结点的顶点值 adjmatrix s 用来处理图中结点的查找与合并 int m1,m2 一条边上两顶点所属集合的序号 int k 最小生成树中的边数 int d //图中待扫描边元素的下标(For the Minimum Spanning Tree by Kruskal main data structures edgeset GE store all edges in the figure int n, int e store graph vertices and edges edgeset C storage spanning tree edges in the vexlist gv graph node vertex values ​ ​ adjmatrix s used to process graph node to find and merge int m1, m2 an edge belongs to the set number two vertices int k minimum spanning tree edges int d // figure to be Scan edge element subscript)

s世界计算机视觉三大会议之CVPR会议，中国人发表的经典立体匹配的论文(s World Computer Vision Conference CVPR three meetings, the Chinese classic stereo matching published papers)

说明：  用简单的纹理,做一个跳动的蜡烛火焰效果,适合OPENGL初级用户(With a simple texture, a beating effect of the candle flame, the primary users for OPENGL)

Visual c++串口通信工程开发实例导航，该书采用C++编写，里面包含5个综合实例，适合有一定基础的C++人员学习(Visual c++ serial communication engineering development instance navigation, using c++, the book contains five examples of comprehensive, is suitable for the staff to learn c++ has certain foundation)

Key finder for windows....

GUIWarfareControls，BTRUI文件，可解压查看GUIWarfareControls(GUIWarfareControls, BTRUI file, you can extract the view GUIWarfareControls)

说明：  文件介绍了x264程序的算法流程表，每个函数的内容详细介绍在里面 (Document describes the algorithm flow chart x264 programs, and detailed description of each function in it)

avr单片机通过RS485在线程序升级，编译环境IAR,上位机程序使用VC6.0编写。(AVR microcontroller through the RS485 online upgrade program, the compiler environment IAR, the host computer program written in VC6.0.)

冒泡优化： 如果一个序列是int n[]={1,2,3,4,5,6,7,8,9} , 用正常的冒泡排序需要排8次才行，优化之后1次就好，也就是说序列越接近于正常序列，改进之后的冒泡排序的次数就越少，这样会给一个冒泡排序算法带了很大的效率。 思想：添加一个boolean变量用来判断冒泡是否是已经排好了顺序，如果boolean的值为false，说明是已经排好了，如果boolean的值true，说明没有排好，继续排。(If a sequence is int n [] = {, 1,2,3,4,5,6,7,8,9} need to row 8 times the job after optimization times like normal bubble sort, but alsomeans that the sequence is more close to the normal sequence, improved bubble sort, the less the number, which would give a bubble sort algorithm with a great deal of efficiency. Idea: add a boolean variable used to determine the bubble whether it is already lined up the order, if the boolean is false, indicating already lined up, if the boolean value of true, did not line up, continue to row.)

VC++的一个股票分析软件，适用于参考和学习。(VC++)