登录
首页 » Visual C++ » exp2-1

exp2-1

于 2014-12-31 发布 文件大小:1KB
0 220
下载积分: 1 下载次数: 4

代码说明:

  数据结构(第四版)第二章上机实验题源程序答案详解(Data structure (fourth edition) chapter on lab answer questions Detailed source)

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

发表评论

0 个回复

  • c语言,码图合集
    说明:  a set of uestc computer academic matu
    2020-04-05 20:19:20下载
    积分:1
  • Graph
    采用邻接矩阵实现有向网的存储,建立有向网,并实现单源最短路径算法。(The realization of the use of adjacency matrix to the network storage, the establishment of the network, and to achieve single-source shortest path algorithm.)
    2007-12-25 16:55:03下载
    积分:1
  • zz
    说明:  图的相关操作:建立图,图的遍历,查找元素,删除元素等(Map-related steps: the establishment of map, graph traversal, find elements, delete elements, etc.)
    2008-07-25 15:20:23下载
    积分:1
  • delete
    数据结构 实验练习 删除相同的节点 希望会对大家有所帮助(Data structures lab exercises to remove the same node want to be helpful to everyone)
    2012-11-14 12:59:15下载
    积分: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
  • Prim
    编程实现Prim算法,基于最小堆数据结构,生成最小代价生成树。 (其中随机生成点和边,形成连通图) 根据输入的顶点数的不同,分析时间复杂度。(Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree. Generate weighted undirected complete graph for given size n according to the following approach: 1) Randomly generate n points ( ) on a plane 2) Randomly generate k pairs of points as edges of the graph. 3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge. )
    2011-06-11 16:28:53下载
    积分:1
  • communication
    VC简易通讯录,加强C的编程,熟悉链表文件的使用等。(Simple VC contacts, strengthen C programming, familiar with the use of a linked list file.)
    2012-09-02 17:11:12下载
    积分:1
  • BDX
    设计、编写和调试面向对象C++程序,实现任意两个同类数据比大小 的通用函数(模板),涵盖普通数值型数据之间的比较、两个字符串之间的比较 (按字典序)、两个复数之间的比较(按模大小)等,并通过主函数加以调用和 测试。(Design, writing and debugging of object-oriented C++ procedures to achieve similar data than the size of any two generic functions (template), covering general comparison between numerical data, the comparison between the two strings (lexicographically), two Comparison between complex numbers (modulo the size), and through the main function to be invoked and tested.)
    2020-11-28 13:49:29下载
    积分:1
  • template
    说明:  ACM及各类基本算法模板,包括数据结构,计算几何,字符串,图论,数学,高精度等许多常用模板(ACM basic algorithm and various templates, including data structures, computational geometry, string, graph theory, mathematics, high-precision, and many other commonly used templates)
    2009-08-20 22:37:29下载
    积分:1
  • neu_SSD
    东北大学数据结构实验指导书,2014级东北大学软件学院软件工程专业(Experimental data structure, guide books, Northeastern University, Northeastern University School of Software 2014 Software Engineering)
    2016-06-30 16:12:38下载
    积分:1
  • 696516资源总数
  • 106637会员总数
  • 8今日下载