登录
首页 » Visual C++ » examples-of-data-structure

examples-of-data-structure

于 2013-05-06 发布 文件大小:600KB
0 169
下载积分: 1 下载次数: 1

代码说明:

  吴伟民版数据结构每个算法的c实现方法,并模块化处理,将各个功能分开编程,有助于移植使用(failed to translate)

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

发表评论

0 个回复

  • AVLTree
    好用的平衡二叉树类库,C++类库编写, 好用的平衡二叉树类库,C++类库编写(AVL tree implementation for C++)
    2009-03-12 12:02:05下载
    积分:1
  • jgctgu
    流水线车间的零件加工排序问题,以达到最优的加工顺序,使加工时间最短或零件后期维护费用最少(Plant parts processing pipeline scheduling problem, in order to achieve optimal machining sequence, so that the processing time of the shortest or least parts later maintenance costs)
    2014-05-08 01:12:54下载
    积分:1
  • toycon
    二查树遍历文件,可以用于程序测试,有喜欢的朋友要多多使用哦(Two check tree traversal file that can be used for program testing)
    2012-07-17 15:18:23下载
    积分:1
  • @163
    数值计算方法中高斯主元素消元法 在vc环境中运行 用于解方程组(Numerical methods in the Gaussian elimination method, the main elements of the environment in vc run for the solution of equations)
    2011-10-19 20:28:39下载
    积分:1
  • dd2
    自己用c语言写的一个模块化多电平最近电平调制排序的c程序,希望对大家有帮助(Own use c language written in a modular multi-level modulation level recently sort of c program, we hope to help)
    2014-05-21 20:19:49下载
    积分:1
  • migong
    以一个m*n的长方阵表示迷宫,0和1分别表示迷宫中的通路和障碍。设计一个程序,对任意设定的迷宫,求出一条从入口到出口的通路,或得出没有 通路的结论 (To an m* n the long square maze, 0 and 1, respectively maze of paths and obstacles. Design a program, for any set of the maze, find a path from the inlet to the outlet, or the conclusions drawn without passage)
    2013-06-14 10:24:48下载
    积分:1
  • lianbiaoqiujiaoji
    该程序是数据结构中以链表存储形式来求两个集合的交集,用C++语言描述的(The program is the form of a linked list stored in the data structures to seek the intersection of two sets, C++ language to describe)
    2012-04-24 22:35:37下载
    积分:1
  • linked
    关于二叉树的一些相关代码,运用链表的形式,求二叉树的高度,结点个数以及叶节点个数(Some of the relevant code on the binary tree, using a linked list, find the height of a binary tree, the number of nodes, and the number of leaf nodes)
    2013-02-03 11:10:07下载
    积分:1
  • ds3
    单向链表的创建与操作 设单向链表中节点的数据域的数据类型为整型,编写函数实现以下操作: (1)实现单向链表的创建(包括初始化)与输出操作,节点的个数及节点的数据由用户输入。 (源代码:ds3-1.c) (2)查找给定的单链表中的第i个节点,并将其地址返回。若不存在第i个节点,则返回空地址。 (源代码:ds3-2.c) (3)查找给定的单链表中值为n的节点,并将其地址返回。若不存在值为n的节点,则返回空地址。同时,还应通过参数传回该节点的序号。 (源代码:ds3-3.c) (4)删除给定的单链表中的第i个节点,成功返回1,失败返回0。 (源代码:ds3-4.c) (5)删除给定的单链表中值为n的节点,成功返回1,失败返回0。 (源代码:ds3-5.c) (6)在给定的单链表的第i位上插入值为n的节点。 (源代码:ds3-6.c) (7)在给定单链表的值为m的节点的前面插入一个值为n的节点。 (源代码:ds3-7.c) (Creation and operation of a one-way linked list Set up a one-way linked list data type node integer data fields , write a function to achieve the following: ( 1 ) achieve the creation of a one-way linked list ( including initialization ) and output operation , the number of nodes and node data entered by the user . ( Source : ds3-1.c) ( 2 ) Find a single list given in the i-th node and returns its address . Without the presence of the i-th node , returns an empty address. ( Source : ds3-2.c) ( 3 ) Find a given node in a given value of n single list , and return address . Without the presence of the value of n nodes , returns an empty address. Meanwhile, the number should be returned by the parameters of the node . ( Source : ds3-3.c) ( 4 ) Delete the given singly linked list in the i-th node , the successful return 1, else return 0 . ( Source : ds3-4.c) ( 5 ) to delete a single node in the list is given n , the successful return 1, else return 0 . ( Source : ds3-5.c) ( 6 ) )
    2014-05-11 19:19:41下载
    积分:1
  • lab07
    本例主要设计查找的有关算法,例如有序表的查找和顺序标的查找,顺序查找、折半查找及二叉排序树上查找的基本思想和算法实现等。(In this case mainly designed to find the relevant algorithm, such as an ordered list of the find and order the subject to find, sequential search, binary search and binary sort tree to find the basic idea and algorithm.)
    2013-05-12 22:01:58下载
    积分:1
  • 696518资源总数
  • 106010会员总数
  • 4今日下载