MM1队列模拟

求图的任两结点间的距离，(2) 用二维数组存放C和A ，C是原成本矩阵，A 是求出的距离矩阵 (3) 算法采用三重循环，其中最外层的循环变量必须代表中间结点，中层的循环变量代表头结点而内层循环变量代表尾结点。 (4) 试着把三层循环变量的顺序作些改变，最外层的循环变量仍代表中间结点，而中层循环变量代表尾结点，内层循环变量代表头结点。把两种做法所得结果作比较,看结果是否相同 (5) 显示结果要清晰易懂 (6) 本题运行结果 -Order to map any of the distance between two nodes, (2) with two-dimensional array of storage C, A, C is the original cost matrix, A is to find the distance matrix (3) The algorithm uses the triple loop, one of the most outer loop variable must be representative of intermediate nodes, the middle loop variable represents the first node and the inner loop variable represents the end nodes. (4) tried to three-loop order of the variables to make some changes, the most outer loop variables still represent intermediate nodes, while the middle loop variable represents the end nodes, the inner loop variable represents the first node. The two approaches to compare the results to see whether the results the same (5) shows the results must be clear and understandable (6) The q

是数据结构的课程设计，程序可以运行，但有时会出错，文档也有，希望对大家有帮助。最重要的是很简单，如果你什么都不会，但是课设题目，你就可以用。-Is the data structure of curriculum design, program can run, but sometimes to be wrong, the document also, I hope all of you help. The most important thing is very simple, what if you do not, but the class-based subject, you can use.

共有4个数据结构的实例-a total of four examples of the data structure

国际跳棋，一种古老的棋类游戏。远在古埃及法老时期就已存在，现代国际跳棋是在12世纪定型的。 国际跳棋是由各国的民族跳棋演变而来。其历史源远流长。据史学家研究，跳棋起源于古埃及、古罗马、 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

数据算法，凉东问题-data algorithm, the cooler East problem

这是一个数据无向图的简单模拟程序,可以用于数据结构的学习-This is an undirected graph data a simple simulation program that can be used for data structure learning

自底向上排序：思想: 将数组的个部分,两两有序数组进行合并 算法平均时间复杂度: O(nlogn) -Bottom-up sequencing: thinking: The array of parts 22 in an orderly array merge algorithm for the average time complexity: O (nlogn)

数据结构迷宫-data structure maze

1．定义串的顺序存储结构。 2．编写函数实现串的初始化、分配、取子串算法 3．编写函数据实现串的模式匹配-1. The definition of the order of string storage structure. 2. The initialization string write function implementation, distribution, taking sub-string algorithm 3. Write a function, according to string pattern matching to achieve

Database Viewer application. Allows you to view and scroll through all of the records in a database.