网站首页

登录

bookmanage

于 2020-10-27 发布文件大小:200KB

 0  238

下载积分: 1 下载次数: 6

我要下载

代码说明：

基于数据结构的图书管理系统，基本功能都有，可以拿来作为数据结构的课程设计(Based library management system data structures, basic function, can be used as a data structure of the curriculum design)

文件列表：

图书管理
........\Debug
........\.....\tushuguanli.ilk,243640,2009-06-15
........\.....\tushuguanli.obj,31257,2009-06-15
........\.....\tushuguanli.pch,252092,2009-06-15
........\.....\tushuguanli.pdb,418816,2009-06-15
........\.....\vc60.idb,41984,2009-06-15
........\.....\vc60.pdb,61440,2009-06-15
........\tushuguanli.cpp,12753,2009-06-15
........\tushuguanli.dsp,3461,2009-06-15
........\tushuguanli.dsw,545,2009-06-15
........\tushuguanli.ncb,33792,2009-06-15
........\tushuguanli.opt,48640,2009-06-15
........\tushuguanli.plg,765,2009-06-15

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

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
BinaryTreeViaMFC
画图法实验数据结构中二叉树先序、中序、后序遍历和显示。(Paint Method in the first order binary tree data structure, in order, post order traversal and display.)

2011-05-27 20:14:36下载

积分：1
Function-parameters
C语言插入排序算法及代码 C语言中函数参数的传递有：值传递、地址传递、引用传递这三种形式。题一为值传递，题二为地址传递，题三为引用传递。(Insertion sort algorithm and C language code The parameter of function in C language transfer: transfer value, address, pass by reference to these three forms. Problem a value transfer, the transfer of Title address, three for reference. )

2014-06-30 21:28:28下载

积分：1
Huffman
数据结构，利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)

2014-01-28 18:25:24下载

积分：1
a
说明：进程死锁.资源分配图的绘制 建立所需数据结构；  使用题目21存成的资源分配图的文件作为输入；  编写资源分配图化简算法；  每化简一步，在屏幕上显示化简的当前结果；  最后给出结论，是否死锁，如思索给出死锁的进程及资源； (Process deadlock. Resource allocation mapping  establish the required data structures  Use title 21 deposit into resource allocation graph file as input  writing resource allocation map simplification algorithm  Each simplification step, on-screen display simplification of the current result  Finally, the conclusion of a deadlock, deadlock is given as thinking processes and resources )

2013-07-04 19:50:58下载

积分：1
Huffman-Tree
使用三叉链表实现的哈夫曼树,统计inputfile1.txt中各字符的出现频率，并据此构造Huffman树，编制Huffman 码；根据已经得到的编码，对01形式的编码段进行译码。具体的要求： 1．将给定字符文件编码，生成编码，输出每个字符出现的次数和编码； 2．将给定编码文件译码，生成字符，输出编码及其对应字符。 (Emergence of the frequency of each character in the trigeminal lists using the Huffman tree, statistics inputfile1.txt, and accordingly the Huffman tree structure, preparation of Huffman code according to the coding has been. 01 to form the code segment for decoding. Specific requirements: 1 coding the given character file, generating the encoding, and outputting the number and encoding of each character 2 will be given the encoding file decoding, generating the character, the output code and its corresponding character.)

2015-05-22 15:37:03下载

积分：1
2.2
已知线性表中的元素以值递增有序排列，并以单链表作存储结构。试写一高效的算法，删除表中所有值大于mink且小于maxk的元素（若表中存在这样的元素）同时释放被删结点空间，并分析你的算法的时间复杂度（注意：mink和maxk是给定的两个参变量，它们的值可以和表中的元素相同，也可以不同）。(Known linear elements in the table to the value increments ordered, and a single list for the storage structure. Try to write a highly efficient algorithm to delete all values greater than mink and maxk elements smaller than (if there is such an element in the table) while the release of the deleted node space, and analyze your time complexity of the algorithm (Note: mink and maxk is given two parameters variables, their values and elements in the table can be the same or different).)

2015-04-11 23:11:41下载

积分：1
hamidunp2Boulatu
关于中国邮递员的解决办法，个人觉得还不错的说(Chinese postman)

2012-06-10 17:28:15下载

积分：1
MultifunctionalCalculator
基于MFC平台，实现多功能计算器，可求解复杂表达式，主要实现为数据结构中链表和数组，对于要熟悉链表和数组的初学者有很帮助。(Based on the MFC platform, to achieve multi-function calculator, can solve complex expressions, the main realization of the data structure for the list and array, to be familiar with the list and the array of beginners helpful.)

2016-10-04 13:20:37下载

积分：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

696518资源总数
104269会员总数
31今日下载