搜索资源列表
hafum
- 这是一个用C语言编写的哈夫曼编/译码器程序，与严蔚敏版数据结构习题的5.2相对应啊-This is a C language prepared by the Huffman encoder / decoder procedures, and Yan Wei-min data structure Exercise version 5.2 should be relatively ah
严蔚敏《数据结构》答案
- 严蔚敏《数据结构》答案，一本经典的严蔚敏《数据结构》的辅助书籍-Yan Wei Min "data structure," the answer, a classic Yan Wei Min "data structure," the auxiliary books
nearpiont
- 最接近点对问题是求二维坐标中的点对问题，该算法是为了将平面上点集S线性分割为大小大致相等的2个子集S1和S2，我们选取一垂直线l:x=m来作为分割直线。其中m为S中各点x坐标的中位数。由此将S分割为S1={p∈S|px≤m}和S2={p∈S|px>m}。从而使S1和S2分别位于直线l的左侧和右侧，且S=S1∪S2 。由于m是S中各点x坐标值的中位数，因此S1和S2中的点数大致相等。 递归地在S1和S2上解最接近点对问题，我们分别得到S1和S2中的最小距离δ1和δ2。现设δ=min(δ
LetterAssitant
- 严蔚敏版《数据结构（C语言）》里的实习作业之“文学助手(LetterAssistant)”-Yan Wei-min version of "data structure (C language)," The internship operations, "Literature assistant (LetterAs sistant) "
disanzan
- 这是自己编写的,严蔚敏版的数据结构第三章的部分答案-This is their preparation, Yan Wei-min version of the data structure of Chapter III Part of the answer
suanshubiaodashiqiuzhi
- 按照《数据结构习题集》严蔚敏版的实验2.5做的算术表达式求值演示。-accordance with the "data structure Exercises Set" Yan Wei-min 2.5 version of the experiment do the arithmetic expression evaluates demonstration.
tsinghuadatastructureallcode(CLanguage)2
- 清华 严蔚敏《数据结构》的全部代码实现C语言 -Qinghua Yan Wei Min "data structure" to achieve the full C language code
严蔚敏老师专贴
- 严蔚敏老师的数据结构专贴。考研的朋友要好好看哦 是内部资料啊-Yan Wei Min teacher posted a data structure. Graduates to make good friends FACT internal information ah
数据结构1
- 里面介绍的是严蔚敏《数据结构(c语言版)习题集》第二章答案-introduced inside the Yan Wei Min "data structure (c language version) Exercise Book," the second chapter answer
minbinoheapandminleftisttree
- This code implements min binomial heaps and min leftist trees.Plus, measure and compare the relative performance of these two implementations under the assumption that the only permissible operations are insert and delete-min.
aaa
- 分治法解决最近对问题 画一条垂直线x=c，把这些给定点分为两个包含n/2个点的子集S1和S2，使得n/2个点位于直线的左侧或直线上，另外n/2个点位于直线的右侧或直线上；遵循分治法的思想，递归地求出左子集S1和右子集S2中的最近对，分别为d1与d2；之后d=min{d1,d2}。合并过程：在以垂线x=c为对称轴，2d为宽度的区域内求最近两个点的距离，记为d3；求D=min{d,d3}；
dom.cpp 亲兄弟问题
- Ex3-23 亲兄弟问题 « 问题描述： 给定n 个整数0 1 1 , , , n- a a a 组成的序列。序列中元素i a 的亲兄弟元素k a 定义为： min{ | } k i j n j j i a = a a ³ a < < 。 亲兄弟问题要求给定序列中每个元素的亲兄弟元素的位置。元素i a 的亲兄弟元素为k a 时，称k 为元素i a 的亲兄弟元素的位置。当元素i a 没有亲兄弟元素时，约定其亲兄弟元素 的位置为-1。
BCbc
- 严慰敏，吴伟民版数据结构树上算法的具体实现c++版本-Yan Wei Min, Xiulan WU Weimin version of the tree data structure to achieve the specific algorithm c version
排序6和1
- 包括数据结构中最常用的6种排序算法和相关解释，适用与严蔚敏的c语言版。-including data structure of the six most common types of algorithm and the related interpretation, application and Yan Wei Min c language version.
一元稀疏多项式的计算
- 一元多项式的计算,建立两个多项式，并进行相加，相减运算，输出结果.参考资料：严蔚敏《数据结构与算法》-one yuan polynomial calculations, the establishment of two polynomials, and together, subtract operation, the output results. References : Yan Wei Min "data structure and algorithm"
min-max-array
- A simple programm that finds minimun and maximun value of 10 elements.
datastructurePPT.rar
- 数据结构严蔚敏版本的数据结构PPT。内容详细，每个算法都有详细演示。,Data Structure YAN Wei-min version of the data structure of PPT. Details, each algorithm has a detailed presentation.
数据结构算法解析
- 配合严蔚敏的数据结构的辅导书，内有书中程序的代码实现——高一凡所著的数据结构算法解析的第一章绪论。,YAN Wei-Min with the data structure of the counseling book, there are procedures code book- written by high and one where the data structure algorithm to resolve the first chapter of the Introduction.
Data_Struc
- 这个是严蔚敏版的数据结构上机教程中的部分源代码，都是自己写的，包括最短路径的dijkstra,floyd，最小生成树的prim,kruskal以及链表，Huffman Tree等等的c++代码-This is Yan Wei-min version of the data structure on the machine part of the tutorial source code, are written in their own, including the shortest path
Data-Structure(yan-wei-min)
- 经典的严魏敏数据结构课后答案，每章都有很详细的答案，很值得大家去学习，有助于理解数据结构-Classic Yan Wei Min data structure after-school answer, each chapter has a very detailed, very worth learning, help to understand the data structure