Graph

总结了10种排序的方式。用代码加以实现。(the ten way of Line up a preface)

校园导航问题，设计你的学校的平面图，至少包括10个以上的景点（场所），每两个景点间可以有不同的路，且路长也可能不同，找出从任意景点到达另一景点的最佳路径（最短路径）。 要求： （1）以图中顶点表示校园内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等有关信息。 （2）为来访客人提供图中任意景点相关信息的查询。 （3）为来访客人提供任意景点的问路查询，即查询任意两个景点之间的一条最短路径。 （4）修改景点信息。 (Campus navigation problem, the design of your school s plan, at least more than 10 attractions (places), between every two spots can have a different way, and the long road may be different, to find spots to reach from any other attractions best path (shortest path). Requirements: (1) graph vertices represent various campus sites, storage sites name, code, profile and other information the side that path, the path length of storage of information. (2) the figure for visiting any sites offering information about the query. (3) any attractions for visiting guests ask queries of that query any two of the shortest path between sites. (4) modify the attractions information.)

这个程序用来解决树结构与树之间的程序匹配的问题这个程序可以解决很多的问题(it is very good)

数据结构与程序设计中的重点例子程序：八皇后问题(Data structure and procedures of the focus of the design example of the procedure: eight queen problem)

数据结构里面的KMP算法的可视化演示程序 MFC实现(Visualization of data structures inside the KMP algorithm demo program MFC implementation)

使用非递归的方法遍历二叉树，可以直接运行。( Non-recursive binary tree traversal.)

用c语言写的线性链表的创建、删除、插入、销毁代码(With c language to create a linear linked list, delete, insert, destroy code)

大学软件工程数据结构课程设计二叉树实验三种遍历方法(curriculum design,structure data)

大二时做的一个数据结构的课程设计，用2-3树实现的图书馆管理系统，只是控制台程序，没有很好的图形界面。包括管理员、读者。管理员功能有：采编入库、查看图书、查看读者、删除读者。读者功能有：借书、还书、预约、查找等等。。功能全面。包括注册账号，登录需要账号密码。(Sophomore to do a data structure of the curriculum design, with 2-3 tree implementation of library management system, but the console program, not a good graphical interface. Including administrators, readers. Administrator functions include: editing storage, check books, check readers, delete readers. Reader functions: library, book, booking, search and so on. . Full-featured. Including the registration account, login account password required. )

C语言实现井字棋博弈的过程，采用极大极小算法。(The C language game of tic-tac-toe chess, using the minimax algorithm.)