▍1. Teaching-plan
数据结构课程设计,使用图实现教学计划安排(Data structure curriculum design, teaching plan using graph implementation)
数据结构课程设计,使用图实现教学计划安排(Data structure curriculum design, teaching plan using graph implementation)
2.4 线性表的应用举例 线性表的链式存储结构 线性表的顺序存储结构是指用一组连续的存储单元依次存储线性表中的每个数据元素。 (2.4 Application examples linear table storage structure linear form linear chain sequence table storage structure refers to a group of contiguous memory locations sequentially stores linear table for each data element.)
本实验设有一个线性表,分别实现数组结构存储的原地逆置。为数据结构课程必做实验。(This experiment has a linear form, respectively, to achieve the storage array structure in situ reverse home. For the data structure courses will do the experiment.)
说明: 数据结构算法实现C++ Builder上机验证实现(Data structure algorithms to achieve local authentication on C++ Builder)
数据结构快速排序例程代码,只要按照例子就可以很容易加入到你的程序当中。(Data Structures quick sort routine code, just follow the example you can easily add them into your program.)
VC游戏编写中的求解最短路径算法源码,本示例是自动寻径演示,篮点是起点,红点是终点,按确定键开始。源码爱好者注:编译后运行的时候请把EXE文件从Debug目录中拷贝到项目根目录中,若不然会出错。 (The preparation of the VC games to solve the shortest path algorithm source code, in this example is the automatic routing demonstration, the basket is the starting point, the red dot is the end point, press the OK button to start. Source enthusiasts Note: When compiled and run, please copy the EXE file from the Debug directory to the root directory of the project, and if not be wrong.)
矩形件最优排样的程序,用Visual C编写,在6.0下能正常运行。(Rectangular pieces Optimal Nesting program)
本例主要设计查找的有关算法,例如有序表的查找和顺序标的查找,顺序查找、折半查找及二叉排序树上查找的基本思想和算法实现等。(In this case mainly designed to find the relevant algorithm, such as an ordered list of the find and order the subject to find, sequential search, binary search and binary sort tree to find the basic idea and algorithm.)
一个很好的C语言开发的函数库接口, 可以节省很多开发时间, 可以好好看看哦(A good library of C language development interface, you can save a lot of development time can have a good look.)
kd-树(k维搜索树)是把二叉搜索树推广到多维数据的一种主存数据结构。这里给出了其代码的VC++实现(Classic data structures- KD tree full implementation, with a detailed explanation of the code, the novice data structure good materials)
此程序用于解决8皇后问题,运行后输出8皇后问题的所有解(This program is used to solve the 8 queens problem, all solutions of 8 queens problem output operation.)
吴伟民版数据结构每个算法的c实现方法,并模块化处理,将各个功能分开编程,有助于移植使用(failed to translate)
实现链表的一些操作,方便进行遍历,查找等程序(Operation, convenient linked list traversal, the search procedure)
八皇后的问题的C++简单算法 大学课程作业(Eight queens problem C++ simple algorithm college course work)
直接插入排序算法验证。 快速排序算法验证。 直接选择排序算法验证。 (Direct insertion sort algorithm validation. Quick sort algorithm validation. Direct selection sort algorithm validation.)
利用C语言,链表,实现的一个入栈出栈的小例子(A small example of the C language, which pushed and poped the stack by linked lists.)
迪特斯特拉算法,课程设计的作品,主要计算站点距离的吧,可以看看(Dieter Stella algorithm, distance course design work, the main computing sites can look)
哈夫曼编码的实现,全面解密数据结构中树的有效应用,算法实现的很得体,学习数据结构的都值得参考(Huffman coding to achieve, fully decrypt the effective application of the tree data structure, algorithm is very decent, learn data structures are worth considering)
A*算法 1、将开始节点放入开放列表(开始节点的F和G值都视为0) 2、重复以下步骤: 在开放列表中查找具有最小F值的节点,并把查找到的节点作为当前节点 把当前节点从开放列表删除, 加入到封闭列表. (A* algorithm 1, will begin to node placed in the and opening up list of (the began to node of the F and G values are regarded as 0) 2, repeat the the following steps: to Find a the has a the the smallest F value of the node in the the and opening up list of, and put Find a to the node as the current node current node is removed from the open list, added to the closed list.)