登录
首页 » Visual C++ » B_Tree

B_Tree

于 2020-10-18 发布 文件大小:4KB
0 313
下载积分: 1 下载次数: 88

代码说明:

  B-树的创建、插入、删除等一系列操作!(B-tree creation, insert, delete a series of manipulations!)

文件列表:

B_Tree.cpp

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

发表评论

0 个回复

  • Huffman
    说明:  数据结构:Huffman编码。哈夫曼编码是哈夫曼树的一个应用。哈夫曼编码应用广泛,如JPEG中就应用了哈夫曼编码。 哈夫曼树又称最优二叉树,是一种带权路径长度最短的二叉树。(Data structure: Huffman coding. Huffman coding is an application of the Huffman tree. Huffman coding is widely used, such as JPEG in the application of the Huffman coding. Huffman tree, also known as the best binary tree is a weighted shortest path length binary tree.)
    2011-03-29 22:44:59下载
    积分:1
  • stack
    数据结构 堆栈 实现了以下功能: cout<<"----------------主菜单---------------"<<endl <<"* 1.建立 *"<<endl <<"* 2.输出 *"<<endl <<"* 3.判断栈是否为空 *"<<endl <<"* 4.栈的长度 *"<<endl <<"* 5.输出栈顶元素 *"<<endl <<"* 6.进栈 *"<<endl <<"* 7.出栈 *"<<endl <<"* 8.遍历 *"<<endl <<"* 9.数制转换 *"<<endl <<"* 10.清空 *"<<endl <<"* 11.销毁 *"<<endl <<"* 12.退出 *"<<endl <<"--------------------------------------"<<endl<<endl (data structure stack)
    2013-11-01 11:05:10下载
    积分:1
  • lvxingshang
    一个经典的旅行商问题源码,不是最优解,只是一种 思路(A classic traveling salesman problem source is not the optimal solution, just a thought)
    2012-11-09 01:33:02下载
    积分:1
  • KMP
    数据结构中KMP算法c语言实现,vc6.0环境(KMP algorithm in c language data structure, vc6.0 environment)
    2013-03-27 14:04:39下载
    积分:1
  • EightQueens
    数据结构与程序设计中的重点例子程序:八皇后问题(Data structure and procedures of the focus of the design example of the procedure: eight queen problem)
    2009-06-29 14:52:11下载
    积分:1
  • jiaotongzixun
    数据结构的课程设计,做的是一个交通查询,主要用到图的算法,和大家共享,欢迎指正!(Data structure curriculum design, do a query traffic, mainly used graph algorithms, and share, please correct me!)
    2013-10-28 18:49:11下载
    积分:1
  • edge-betweenness
    计算边介数,复杂网络,中心性计算,介数也可以计算,运用了数据结构,计算大量数据(edge betweenness,complex network, centrality)
    2021-05-15 01:30:03下载
    积分: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
  • code1
    键盘任意输入一组字母或数字生成无序数组,对数组按ASCII顺序进行排序(排序要求至少用两种排序算法),再从键盘输入一个值进行二分查找,返回查找成功或者失败的信息(Keyboard input and a group of letters, or any number of arrays, and generate disordered array sort order according to the ASCII at least two requirements (sort of), sorting algorithms from the keyboard input a value dichotomy, returns to find success or failure of the information)
    2010-07-14 11:42:56下载
    积分:1
  • Huffman
    霍夫曼编码实验报告,内含源代码,编码原理 (Huffman coding lab report, containing the source code, coding theory)
    2011-06-04 20:44:25下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载