-
astar
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.)
- 2013-04-04 11:06:42下载
- 积分：1
-
xx
说明： 数据结构实验报告链表的操作，包括创建空链表、插入、删除节点等(Experimental Report list data structure operations, including creating an empty list, insert, delete nodes, etc.)
- 2009-11-25 08:36:26下载
- 积分：1
-
ACRush_2_1
这是acm高手楼天城的比赛代码，很有用哦，对于提高算法非常有用(This is a master of building Tiancheng acm game code, very useful oh, for improving the algorithm)
- 2011-06-16 21:00:05下载
- 积分：1
-
Airlinereservationsystem
用从语言实现飞机订票系统。程序中用到了数据结构中的队列和栈。(From the language used airline reservation system. Process the data structure used in the queue and stack.)
- 2011-06-04 23:19:23下载
- 积分：1
-
Haffman
将一组数组转换为哈夫曼编码，使用数据结构中的二叉树功能实现(Convert an array to Haffman code)
- 2016-01-30 14:56:20下载
- 积分：1
-
paixu
各种排序算法的实现，如快速排序，冒泡排序，选择排序，堆排序，二分插入排序等(Implementation of various sorting algorithms, such as quick sort, bubble sort, selection sort, heap sort, binary insertion sort, etc.)
- 2010-09-28 22:20:55下载
- 积分：1
-
zuixiaoshengchengshu
最小生成树C语言程序，提供给喜欢编程以及数学建模的同学(Minimum spanning tree C language program)
- 2015-02-08 20:15:45下载
- 积分：1
-
heap
实现栈的基本操作，建栈，进栈，出栈，数据结构实现(To achieve the basic operation of the stack, built stack into the stack, the stack data structure)
- 2013-04-03 11:08:37下载
- 积分：1
-
heapsort
说明： 从最后一个非叶子结点开始从后往前进行调整，保证了根下的所有子树都是最大堆，最后对根进行调整，使整棵二叉树为最大堆，保证了根结点为整棵数的最大值点，完成了建堆的过程，再将根结点跟最后一个结点进行交换，如此反复操作，则堆排序就完成了，其中堆排序的过程采用了满二叉树的概念。(From the final of a non-leaf node after the move began to be adjusted to ensure that the root of all sub-tree are the biggest pile, and finally adjusted to the root, so that the largest heap binary tree整棵to ensure that the root node for整棵the maximum number of points, completed the process of building reactors, and then the last root node with a node to be exchanged, and so repeated the operation, then HEAPSORT completed, of which the process of HEAPSORT a full binary tree concept.)
- 2008-11-11 22:53:42下载
- 积分：1
-
shiyan1
数据结构上机操作实验的实验1，线性表的基本操作！！！(the basic operation of sq of date structure)
- 2011-12-11 18:49:06下载
- 积分：1
