登录
首页 » Visual C++ » DataStructureTest

DataStructureTest

于 2009-01-20 发布 文件大小:381KB
0 230
下载积分: 1 下载次数: 2

代码说明:

  数据结构的一些基本的相关的试验,如二叉树的遍历,打印,如排序算法,检索算法,动态结构的静态实现实验(Data structures related to some basic tests, such as binary tree traversal, print, such as sorting algorithms, search algorithms, the dynamic structure of the realization of the experimental static)

文件列表:

数据结构与算法060481004倪瑞剑
.............................\BinaryTree.doc
.............................\关于文件缺失说明.txt
.............................\实验四(图)
.............................\............\Cpp1.cpp
.............................\............\Cpp1.dsp
.............................\............\Cpp1.dsw
.............................\............\Cpp1.ncb
.............................\............\Cpp1.opt
.............................\............\Cpp1.plg
.............................\............\Debug
.............................\(5)动态结构的静态实现实验.doc
.............................\(6)检索方法实验.doc
.............................\(7)排序实验.doc

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

发表评论

0 个回复

  • library
    纯C语言编程的模拟现有图书馆的借阅、续借、归还;图书入库、出库;查询、排序等功能,实现电子图书馆的智慧综合管理。其中查询功能里面嵌套精确查询,排序功能有六种,界面可变色,里面已经附带50多本图书信息包括图书摘要等详细信息。里面还附带详细设计报告和解说PPt。(Pure C language programming simulation existing library borrow, renew, return book storage, a library queries, sorting and other functions, to achieve integrated management of electronic library wisdom. Precisely where the query function inside a nested query, sort function has six, the interface can change color, which has included more than 50 books including books summary information and other details. Which also included detailed design reports and commentary PPt.)
    2020-10-30 14:59:57下载
    积分:1
  • migong
    简单的迷宫问题,有点土,还望大家多指点指点,在此感激不尽。(????? mad spasm, ? Tang Gao, ? oligonucleotide ??? Ning Ning ? ?, Hitomi ?????.)
    2008-07-05 00:11:37下载
    积分:1
  • tanxinfangfa
    说明:  贪心方法是一种改进了的分级处理方法。它首先根据题意,选取一种量度标准。然后按这种量度标准对这n个输入排序,并按排序一次输入一个量。如果这个输入和当前已构成在这种量度意义下的部分最优解加在一起不能产生一个可行解,则不把此解输入加到这部分解中。这种能够得到某种度量意义下的最优解的分级处理方法称为贪心方法。(greedy method is an improvement of the classification methods. According to its first title Italy, and a selection of standards of measurement. Then, under such a standard measure of this sort n input, with an input an order volume. If the input current and constitutes a measure of significance in this part of the optimal solution together not produce a feasible solution. this solution will not put this added to the importation of decomposition. This can be a meaningful measure of the optimal solution hierarchical method, known as greedy method.)
    2006-05-15 21:50:01下载
    积分:1
  • the-shortest-path-of-chart
    求有向图的最短路劲,根据所给图的边长和顶点,建立有向图,以邻接表的方式存储,并编写程序求从有向图任一点出发的最短路径(according to the graph with sides and vertex, establish a directed graph, and write a program find the shortest path from one of the point of the chart )
    2020-07-16 11:28:50下载
    积分:1
  • mifeng
    c语言平时作业练习,包括输入输出,数组,链表等 c语言平时作业练习,包括输入输出,数组,链表等(output mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifeng)
    2014-04-28 16:01:53下载
    积分:1
  • baiji
    百鸡算法是一种简单的逻辑算法,通过不同的鸡不同的价钱,得出大鸡小鸡的个数(Typical code for white chicken algorithm)
    2012-06-02 16:31:30下载
    积分:1
  • GraphTheory
    讲述数据机构的图论部分和程序设计的关系,适合学习算法的同学学习阅读,很不错的一本书。(Graph theory algorithm and programming)
    2013-12-04 20:12:39下载
    积分:1
  • 2007327
    带权有向以及无向图的各种操作,适合数据结构初学者使用,是图那一章的重点(belt and the right to have no plans to the various operations, data structure suitable for beginners, is the chief focus of the chapter)
    2007-04-22 23:49:54下载
    积分:1
  • yinhangjiasuanfa
    一个很好的银行家算法,能运行(A good banker s algorithm, will be able to run)
    2008-06-14 13:44:24下载
    积分:1
  • maze
    迷宫求解一般采用“穷举法”,逐一沿顺时针方向查找相邻块(一共四块-东(右)、南(下),西(左)、北(上))是否可通,即该相邻块既是通道块,且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)
    2013-12-13 17:55:45下载
    积分:1
  • 696516资源总数
  • 106637会员总数
  • 8今日下载