搜索资源列表
UnionFind
- 这是研究生课程计算方法与技术中讲到的UnionFind算法的具体实现代码。-This is the post-graduate courses and technical calculation method described in UnionFind algorithm to achieve the specific code.
邮局选址问题
- 这个是大家非常熟悉的一个非常常用的算法,邮局选择问题,相信大家一定可以学到很多东西的-This is all very familiar with a very commonly used algorithm, the post office matter of choice, I am sure that you can learn a lot of things
zwqzwqpost
- 这是一个邮局选址问题，计算中心距离最小，希望对大家有帮助-This is a post office site, the minimum distance ICC, we hope to help
post__
- 经典算法实现题--邮局选址问题，包括题目PDF和程序代码实现，与大家分享。-classical algorithm that -- post office location, including the subject PDF and procedures to achieve code share with you.
Post
- 二叉树木后序遍历代码欢迎批评指正,如果有好的代码欢迎发到该网站让大家共享
POST
- 算法分析ACM题目：邮局选址算法 保证能运行！算法分析课程必备！
tanxinfa.rar
- 北京大学研究生课程“算法分析与计算复杂性理论”的课件，讲的是贪心算法。,University post-graduate courses
二叉树结点算法源程序
- 根据一棵二叉树结点的先根序列和中根序列构造该二叉树，并输出该二叉树的后序遍历结果。,According to a binary tree the root node of the first sequence and the sequence structure of the tree root and post the output of the binary tree traversal results.
the_total_collection_of_data_structure_in_c_langua
- 清华严蔚敏C语言版数据结构全集，可以说是pudn上这个主题的最全面的一个集合了，记得有这么一个说法是只有有序组织的信息才是有价值的吧：_数据结构-严蔚敏-C语言版；教学笔记；数据结构算法实现及解析—配合严蔚敏_吴伟民编著的数据结构（C语言版）（作者 高一凡）源代码；数据结构笔记；数据结构复习重点归纳笔记[清华严蔚敏版]；数据结构题集-严蔚敏；数据结构题集-严蔚敏；严蔚敏老师专贴。-Wei-Min Yan Tsinghua C language version of The Complete Wo
yuanma
- 通过现有的人口数据结构特点，对其进行拟合分析后进行长短期的预测-Population data through the existing structural features, their post-fitting analysis of the short and long-term prediction
hash
- 查找： 建立一个哈希查找表，哈希函数采用: H(key)= key P(其中P=13)，若发生冲突后,用链地址法解决冲突。-Search: the creation of a hash lookup table, the use of hash function: H (key) = key P (of which P = 13), if the occurrence of post-conflict, and conflict resolution chain address law.
suanfasheji
- 邮局选址问题 算法设计 c++邮局选址问题 算法设计 c-post
search
- 树的遍历（非递归方式实现）：首先按中序方式建立树并输入节点信息，通过栈实现树的非递归方式的先序、中序和后序的遍历-Tree traversal (non-recursive way): First of all, by the way in order to establish the tree and enter the node information, the realization of the tree through the stack of the first non-recurs
20071160083341
- 二叉树的遍历，中序，后序，前序。 二叉树的遍历，中序，后序，前序。-Binary tree traversal, in order, post order, the former order. Binary tree traversal, in order, post order, the former order. Binary tree traversal, in order, post order, the former order.
binarytree
- 二叉树的排序！前序，中序及后序，并求其深度-Binary tree sort! Pre-order, middle order and post order, and to seek its depth
f31
- 蛇顺序表中的关键字是递增有序的，将监视哨设在高下标端，设计算法实现简单顺序查找-Snake order keyword in the table are incremental and orderly, and will monitor the post is located in Gao Xia S side, the design algorithm is simple in order to find
Text6_2
- （1）分别采用递归和非递归算法建立二叉树； （2）采用先序、中序和后序三种方式遍历该二叉树； （3）按层次遍历该二叉树。 -(1) were used to establish the recursive and non-recursive algorithm for binary tree (2) using first-order, middle order and post-order traversal of the binary tree in three ways (
ee
- 关于素数变化的题目，输入一对素数，每个是4位数，每次只能变化一位数，且变化后的数还是素数，求经过多少次变化，能变成另一个输入的素数-With regard to changes in the subject of prime numbers, enter a pair of prime numbers, each is a 4-digit, each only a few changes, and changes in the number of post-prime, or seeking m
123
- 一个关于素数变化的题目，输入一对素数，每个是4位数，每次只能变化一位数，且变化后的数还是素数，求经过多少次变化，能变成另一个输入的素数-A prime number changes on the subject, enter a pair of prime numbers, each is a 4-digit, each only a few changes, and changes in the number of post-prime, or seeking many times the c
The-post-office-location
- 这是一个邮局选址问题。给定n 个居民点的位置,编程计算n 个居民点到邮局的距离总和的最小值。上传文件包括可执行文件、源代码和六组测试用例。-This is a post office location problem. N settlements given location, programming calculation of n settlements to the sum of the minimum distance from the post office. Upload files