读取excel文件

Move Image from one place to another just single touch

采用邻接矩阵表示无向图，完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型，图中顶点序号按字符顺序排列。本输入样例中所用的图如下所示： Input Format: 第一行输入两个值，第一个是图中顶点的个数，第二个是图中边的条数 第二行输入各顶点的信息，即输入每个顶点字符 第三行开始输入每条边，每条边的形式为两个顶点的序号，中间以空格隔开，输入完一条边换行 Output format: 首先输出图的顶点信息，输出完毕换行 接着输出图的邻接矩阵，假如图中有n个顶点，则输出形式为n行n列的邻接矩阵，输出完毕换行 接下来一行输出从图的第一个顶点开始进行深度优先遍历的序列，中间以空格隔开，输出完毕换行 最后一行输出从图的第一个顶点开始进行广度优先遍历的序列，中间以空格隔开，输出完毕换行 -Using an undirected graph adjacency matrix representation to complete the map creation, graph depth-first traversal, graph breadth-first traversal operation. In which vertex information is character, the graph vertex number by characters in order. The input sample used in the diagram are as follows: Input Format: The first line of input two values, the first one is the number of graph vertices, the second one is the number of graph edges Second row, enter information in each vertex, that enter each vertex character Start typing in the third line of each side, each side in the form of two vertices

贪心算法解决分割问题 给定一定的宽度，和N个输入（宽度） 得出最小的宽度-greedy algorithm to solve the segmentation problem must set the width and N input (width) reached the minimum width

自动化坐标轴，限制数据4000以内 自 动化坐标轴，限制数据4000以内-Automation axes to limit the data within the automated axes 4000, restrict data within 4000

强大易用的XML文件解析器，使用起来非常非常方便。-The idea of this project was simply to write a basic XML parser in ANSI C for portability. The parser is reasonably forgiving as I have only a fairly rudimentary knowledge about XML and wanted to keep the code reasonably straight forward.

用 c + + 打乒乓球

这是DUILIB2.0的源码，相对于DUILIB1.0结构更清晰，更稳定。

有关c++学习的笔记，希望对大家有帮助，谢谢交流-Related c++ Study notes, in the hope that everyone has to help, thank you sharing

一个游戏编程的实例-a game programming examples

把从摄像机采集到的图像，经过处理好显示出来的程序-Collected from the camera image is displayed after a good deal with the procedures