-
B_Tree
用控制台实现了经典的数据结构B树,可以通过测试文件.txt加载已有的B树,有插入,删除,查找的功能,加深对数据结构的理解。(Using the console to achieve the classic B tree data structure, you can pass the test document. Txt already loaded B-tree, there are insert, delete, search functions, to deepen understanding of the data structure.)
- 2020-10-18 17:47:26下载
- 积分:1
-
zhaose
本代码是通过C语言来实现贪心算法求着色问题,包括具体问题和实现代码(This code is the C language to implement the greedy algorithm for the coloring problem, including specific issues and the implementation code)
- 2013-09-23 16:04:24下载
- 积分:1
-
Devillanguage1
Devil language
数据结构中的经典问题
此为问题!(Devil language data structure of the classic problems of this problem!)
- 2006-10-17 23:42:17下载
- 积分:1
-
SeqQueue
数据结构循环队列的实现 在visual c++6.0运行(Circular queue data structure to achieve the visual c++6.0 run)
- 2013-06-15 16:27:32下载
- 积分:1
-
0829-Binary-Tree
二叉搜索树的生成和查找节点,北大《数据结构与算法》教材的习题(The generation and find nodes of a binary search tree, Peking University, " Data Structures and Algorithms" textbook exercises)
- 2012-11-28 14:51:01下载
- 积分:1
-
InverseList
说明: 链表逆转,实现单链表的逆转程序,数据结构(List Inverse)
- 2011-04-04 11:15:58下载
- 积分:1
-
binary-tree
数据结构 二叉树的操作,可以对二叉树进行最基本的操作,先建立二叉树。(The operation of the binary tree, binary tree with the most basic operation, first create a binary tree.)
- 2012-03-20 21:19:43下载
- 积分:1
-
PX
说明: 一个用VS2008编写的冒泡排序算法演示程序,数组都是随机生成的。(Bubble Sort)
- 2014-06-18 20:06:13下载
- 积分:1
-
adms
阿当姆斯显式和隐式求解方法,用四阶龙格库塔作为起始,然后运用四阶阿当姆斯算法求解初值问题。主要程序包含在test2.cpp中,方法简单易懂。编译环境VC2010(Adam James explicit and implicit method for solving fourth-order Runge-Kutta as a start, then use the fourth-order A Williams algorithm for solving initial value problem. The main program contains in test2.cpp method is simple and easy to understand. Compile environment VC2010)
- 2012-06-09 11:27:18下载
- 积分:1
-
Project_ShortestPath
任务:实现Dijkstra算法
工程名:Project_ShortestPath
要求:实现Dijkstra算法,算法主体写在CGraph类中;要求是从command窗口中输入源节点编号,并在command窗口中输出从源节点到所有目的节点的最短路长及最短路。注:要输出整条路径,而不仅仅是前一跳,也不允许逆序输出。
(Task: Dijkstra' s algorithm to achieve the project name: Project_ShortestPath requirements: achieve Dijkstra algorithm, the algorithm written in the body CGraph class requires input from the command window, the source node number, and in the command window, all of the output from the source node to the destination node shortest long and the shortest. Note: To export the entire path, not just before the jump, do not allow reverse output.)
- 2013-08-21 16:40:41下载
- 积分:1