-
Cpp1
校园导游,可以选择景点序号来了解景点,通过选择两点可计算最短距离和最近路线。(Campus tour guide, you can choose the attractions serial number to understand the attractions of by selecting the shortest distance can be calculated and the recently routes.)
- 2012-06-20 21:57:32下载
- 积分:1
-
adms
阿当姆斯显式和隐式求解方法,用四阶龙格库塔作为起始,然后运用四阶阿当姆斯算法求解初值问题。主要程序包含在test2.cpp中,方法简单易懂。编译环境VC2010(Adam James explicit and implicit method for solving fourth-order Runge-Kutta as a start, then use the fourth-order A Williams algorithm for solving initial value problem. The main program contains in test2.cpp method is simple and easy to understand. Compile environment VC2010)
- 2012-06-09 11:27:18下载
- 积分:1
-
3.4.6
单链表中的数据元素含有三种字符(字母、数字、其他字符),算法实现构造三个循环链表,是每个循环链表中只含有同一类字符,且利用原表中的结点空间作为这三个表的结点空间。(Singly linked lists of data element contains three characters (letters, Numbers and other characters), the algorithm constructs three circular linked list, each cycle list contains only the same type of character, and make use of the primary node space in a table as a node of the three table space.)
- 2014-04-15 13:11:37下载
- 积分:1
-
bintree
一个关于二叉树应用的小程序,包括二叉树的建立,前中后遍历等操作(a program about bintree structure)
- 2009-05-17 16:54:29下载
- 积分:1
-
erchashu
二叉树的链式存储、先序中序遍历和层次遍历。(构造一棵树并输入数据,编写三个函数,非别是树的前序递归遍历算法、树的后序递归遍历算法、树的非递归中序遍历算法(这里的非递归以中序为例)。在主程序中调用这三个函数进行树的遍历,观察用不同的遍历方法输出的数据的顺序和验证递归与非递归输出的数据是否一样。)(Chain store binary tree, preorder traversal and hierarchy traversal.)
- 2013-12-07 23:16:06下载
- 积分:1
-
floy
floyd算法
数据结构
求最短路径(floyd algorithm for data structure for shortest path)
- 2007-11-13 23:39:25下载
- 积分:1
-
fiterVC051002116
用VC++编写中值滤波的算法,具有图形界面(The algorithm of Filter ,which use VC++)
- 2009-09-09 21:40:43下载
- 积分:1
-
xianxinglianbiao
c语言编写链式线性表的初始化,创建,插入删除等操作。(c language chained linear table is initialized, create, insert and delete operations.)
- 2013-11-09 14:30:30下载
- 积分:1
-
Huffman-Tree
使用三叉链表实现的哈夫曼树,统计inputfile1.txt中各字符的出现频率,并据此构造Huffman树,编制Huffman 码;根据已经得到的编码,对01形式的编码段进行译码。
具体的要求:
1.将给定字符文件编码,生成编码,输出每个字符出现的次数和编码;
2.将给定编码文件译码,生成字符,输出编码及其对应字符。
(Emergence of the frequency of each character in the trigeminal lists using the Huffman tree, statistics inputfile1.txt, and accordingly the Huffman tree structure, preparation of Huffman code according to the coding has been. 01 to form the code segment for decoding.
Specific requirements:
1 coding the given character file, generating the encoding, and outputting the number and encoding of each character
2 will be given the encoding file decoding, generating the character, the output code and its corresponding character.)
- 2015-05-22 15:37:03下载
- 积分:1
-
abc
数据结构的稀疏矩阵的几部分操作,广工的课程设计(Sparse matrix operations)
- 2013-12-03 15:57:53下载
- 积分:1