-
linked
关于二叉树的一些相关代码，运用链表的形式，求二叉树的高度，结点个数以及叶节点个数(Some of the relevant code on the binary tree, using a linked list, find the height of a binary tree, the number of nodes, and the number of leaf nodes)
- 2013-02-03 11:10:07下载
- 积分：1
-
ysph
约瑟夫环，数据结构算法，挺有意思，看看，看看(ysphdfgfgf)
- 2009-03-14 00:16:15下载
- 积分：1
-
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
-
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
-
PrintTheSchedule_DataStructure_Lab4
数据结构试验-打印输出计算机本科专业4年每学期的课表；C++实现；图的邻接表存储结构以及拓扑排序的基本思想(Data structure test- printout computer 4 years of undergraduate per semester timetables C++ achieve basic idea of the adjacency table storage structure and topological sorting)
- 2012-11-24 23:30:41下载
- 积分：1
-
mowang-language
魔王语言：输入一串字符，可自动翻译成一串语言。(the program of language)
- 2014-07-12 21:57:27下载
- 积分：1
-
PolynomialCoeff
NTL应用——大数系数多项式乘法的计算。从文件读如参数，计算多项式相乘后某项的系数(NTL application- the multiplication of big numbers coefficient polynomial )
- 2021-04-11 09:58:58下载
- 积分：1
-
ecs
说明： 二叉树的演示程序。实现了二叉树和哈弗曼树(Binary tree demo program. Implements a binary tree and the tree Hafu Man)
- 2011-03-26 11:59:58下载
- 积分：1
-
length
利用佛洛伊德算法计算节点之间的最短路径,用于复杂网络中计算平均路径长度(average path lengh)
- 2011-09-01 11:13:51下载
- 积分：1
-
Figure-topological-sort
说明： 拓扑排序
对一个 有向无环图 G进行拓扑排序，是将G中所有顶点排成一个线性序列，使得图中任
意一对顶点u和v，若u，v ∈E，则u在线性序列中出现在v之前。
通常，这样的线性序列称为满足拓扑次序的序列，简称 拓扑序列 。
注意：
①若将图中顶点按拓扑次序排成一行，则图中所有的有向边均是从左指向右的。
②若图中存在有向环，则不可能使顶点满足拓扑次序。
③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort
In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post
Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before.
Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence.
Note:
(1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing.
(2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence.
(3) a DAG topological sequence usually expressed some scheme is feasible.
)
- 2011-03-22 17:19:14下载
- 积分：1
