2007327

A*算法通过启发式探索下一结点，逐步逼近目标结点，且使得路径最短。(A* algorithm heuristic to explore the next node, and gradually approaching the target node, and that the shortest path.)

数据结构中基于约瑟夫环问题，用C++方式实现的。。。。。(Data structure based on Josephus problem with C++ a manner. . . . .)

说明：  一个用VS2008编写的冒泡排序算法演示程序，数组都是随机生成的。(Bubble Sort)

一个经典的旅行商问题源码，不是最优解，只是一种 思路(A classic traveling salesman problem source is not the optimal solution, just a thought)

对于给定的n个字符串，请找出一种最佳的连接方式，使得采用该连接方式得到的字符串在所有连接的结果中，字典序最小(For a given n-string, find an optimal connection, making use of the connection string to get the results in all connections, the lexicographic minimum)

图的遍历的实现，文字界面，包含深度遍历和广度遍历两种情况~~(Graph traversal implementation, the text interface, including the depth and breadth traversal traverse both cases ~ ~)

数据结构课程设计 数据结构B+树 B+ tree Library(B+ tree Library)

说明：  用从c＋＋写的floyd最短路径算法，可以求邻接矩阵任意两点的最短路径。(from using c++ to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.)

c语言编写链式线性表的初始化，创建，插入删除等操作。(c language chained linear table is initialized, create, insert and delete operations.)

最短路径算法。 用无向带全图的邻接矩阵存储图，确定从源点出发到其它各点的最短路径。 输入：图中包含的顶点数n 边数m， 各边权值，用邻接矩阵或者邻接表存储。 输出：源点到其它各点的最短路径值。(Shortest path algorithm. Adjacency matrix storage with undirected graph with a full figure, determine the starting point of the shortest path from the source point of each other. Input: Vertices figure included n the number of edges m, the weight of each side, with the adjacency matrix or adjacency table storage. Output: source shortest path to value each other points.)