登录
首页 » Visual C++ » FreeTree

FreeTree

于 2013-10-29 发布 文件大小:3615KB
0 187
下载积分: 1 下载次数: 12

代码说明:

  无环连通图G=(V, E)亦称为自由树T,其直径是树中所有顶点之间最短路径的最大值,设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Hanoi
    简单的汉诺塔算法,采用归约算法的思想,实例是三个盘子,三个柱子(Simple HANOR algorithm)
    2012-07-16 20:48:59下载
    积分:1
  • Strassen-code
    思塞恩算法 常用算法之一 算法导论提及(strassen algorithm which can run correctly)
    2014-11-28 14:33:16下载
    积分:1
  • Huffman
    哈夫曼树可以使读者快速方便的查找所需文件(Huffman tree allows readers to quickly and easily find the file)
    2010-06-09 13:09:47下载
    积分:1
  • Huffman
    数据结构,利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)
    2014-01-28 18:25:24下载
    积分:1
  • car
    停车场管理系统 c语言实现 停车场拥有M个车位和一条进入停车场的便道,便道上最多停放N辆汽车。汽车要想进入车位,首先进入便道等候。若有空闲车位,则停车入位,否则在便道继续等候,直至有车位空出。若便道已经停满等候的汽车,后到达的汽车只能离开,选择其他停车场。设计一个停车场管理系统,模拟停车场的运作,并统计停车场的收入。(Parking Management System with M c language parking spaces and a sidewalk into the parking lot, parked up on the sidewalk N cars. To enter the car parking spaces, first into the pavement waiting. If free parking, the parking into place, or in the sidewalk to wait until the needed spot. If the sidewalk is already full of parked cars waiting, after the arrival of the vehicle to leave, choose a parking lot. Designing a car park management systems, simulation parking operations and parking revenue statistics.)
    2011-08-21 21:55:11下载
    积分: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
  • polynomial
    说明:  线性表的基本运算及多项式的算术运算在顺序表泪SeqList 中增加成员函数void Reverse()实现顺序表的逆置 (Linear form the basic arithmetic operations and the polynomial form in order to increase tear SeqList member function void Reverse () to achieve the inverse order of the table set)
    2010-04-20 20:11:40下载
    积分:1
  • Binary_tree
    二叉树的C++实现,成员可以自己调整,实现了各种修剪此树的方法:初始化,增加节点,删去节点,复制树,读取节点,遍历树(Binary tree in C++, members can make their own adjustments to achieve a variety of pruning this tree methods: initialize, add nodes, delete nodes, copy the tree, read the node, traverse the tree)
    2011-10-22 23:51:28下载
    积分:1
  • code
    各种数据结构代码,欢迎下载,里面有JAVA,C,C++等等各种版本(Data structure and code, please download)
    2010-06-22 11:11:45下载
    积分:1
  • 851DataStructure2009
    江苏大学数据结构研究生试题2009Jiangsu University graduate examination papers(Jiangsu University graduate examination papers)
    2011-09-25 11:51:05下载
    积分:1
  • 696518资源总数
  • 105549会员总数
  • 12今日下载